Skip to main content
SpringerLink
Log in

A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph

  • Conference paper
Distributed Computing and Networking (ICDCN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4904))

Included in the following conference series:

Abstract

The chromatic sum of a graph G is the minimum sum of colors in a vertex coloring of G. This problem has many interests like in networks, where it models the minimization of the total charge of a network. As systems are more and more large and dynamic, distributed approaches are needed to manage them. In this paper we present a self-stabilizing algorithm to determine a minimal sum of colors for a graph. Such a coloring is determined with at most O(nΔ 2) changes of colors, where Δ is the maximum degree of the graph.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antonoiu, G., Srimani, P.K.: A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph. Computer & Mathematics with Application 35(10), 15–23 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bar-Noy, A., Bellare, M., Halldórsson, M., Shashnai, H., Tamir, T.: On Chromatic Sums and Distributed Resource Allocation. Information and Computation 140, 183–202 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bar-Noy, A., Kortsarz, G.: Minimum color sum of bipartite graphs. Journal of Algorithms 28(2), 339–365 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  5. Effantin, B., Kheddouci, H.: Sum coloring of distance and circulant graphs. In: 7th International Colloquium on Graph Theory. Electronic Notes in Discrete Mathematics, vol. 22, pp. 239–244 (2005)

    Google Scholar 

  6. Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graph. Distributed Compututing 7(1), 55–59 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: OPODIS 2000. Proceedings of the International Conference on Principles of Distributed Systems, pp. 55–70 (2000)

    Google Scholar 

  8. Hajiabolhassan, H., Mehrabadi, M.L., Tusserkani, R.: Minimal Coloring and Strength of Graphs. Discrete Mathematics 215(1-3), 265–270 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Linear time self-stabilizing colorings. Information Processing Letters 87, 251–255 (2003)

    Article  MathSciNet  Google Scholar 

  10. Hsi, S-C., Huang, S-T.: A self-stabilizing algorithm for maximal matching. Information Processing Letters 43(2), 77–81 (1992)

    Article  MathSciNet  Google Scholar 

  11. Huang, S.-T., Hung, S.-S., Tzeng, C.-H.: Self-stabilizing coloration in anonymous planar networks. Information Processing Letters 95, 307–312 (2005)

    Article  MathSciNet  Google Scholar 

  12. Jiang, T., West, D.B.: Coloring of Trees with Minimum Sum of Colors. Journal of Graph Theory 32, 354–358 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kubicka, E.: The chromatic sum of a graph, Ph.D. Dissertation. Western Michigan University, Kalamazoo, MI (1989)

    Google Scholar 

  14. Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: Proceedings of the seventeenth annual ACM conference on Computer science, pp. 39–45 (1989)

    Google Scholar 

  15. Nicoloso, S.: Sum coloring and interval graphs: A tight upper bound for the minimum number of colors. Discrete Mathematics 280, 251–257 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Salavatipour, M.: On Sum Coloring of Graphs. Discrete Applied Mathematics 127(3), 477–488 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Shi, Z., Goddard, W., Hedetniemi, S.T.: An anonymous self-stabilizing algorithm for 1-maximal independant set in trees. Information Processing Letters 91, 77–83 (2004)

    Article  MathSciNet  Google Scholar 

  18. Shukla, S., Rosenkrantz, D., Ravi, S.: Development self-stabilizing coloring algorithms via systematic randomization. In: Proceedings of the International Workshop on Parallel Processing, pp. 668–673 (1994)

    Google Scholar 

  19. Supowit, K.J.: Finding a maximum planar subset of nets in a channel. IEEE Transactions on Computer Aided Design 6(1), 93–94 (1987)

    Article  Google Scholar 

  20. Sur, S., Srimani, P.K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Science 69, 219–227 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lyon, F-69003, France

    Huang Sun, Brice Effantin & Hamamache Kheddouci

  2. Laboratory LIESP, Université Lyon 1, Bâtiment Nautibus (ex.710), 43 bd du 11 Novembre 1918, 69622, Villeurbanne Cedex, France

    Huang Sun, Brice Effantin & Hamamache Kheddouci

Authors
  1. Huang Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brice Effantin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hamamache Kheddouci
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shrisha Rao Mainak Chatterjee Prasad Jayanti C. Siva Ram Murthy Sanjoy Kumar Saha

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, H., Effantin, B., Kheddouci, H. (2007). A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77444-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77443-3

  • Online ISBN: 978-3-540-77444-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation