Skip to main content
SpringerLink
Log in
Book cover

Symposium on Self-Stabilizing Systems

SSS 2008: Stabilization, Safety, and Security of Distributed Systems pp 19–31Cite as

Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs

  • Conference paper

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

Abstract

A b-coloring of a graph G is a proper k-coloring of G such that for each color i, 1 ≤ i ≤ k, at least one vertex colored with i is adjacent to every color j, with 1 ≤ j ≠ i ≤ k. This kind of coloring is useful to decompose any system into communities, where each community contains a vertex adjacent to all the other communities. This kind of organization can provide improving in many fields, especially in the data clustering. In this paper we propose a new self-stabilizing algorithm for finding a b-coloring of arbitrary undirected connected graphs. Because the characteristics of the b-coloring problem, the proposed self-stabilizing algorithm use a distance-2 knowledge.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about 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 moinimal spanning tree problem in a symmetric graph. Computer and Mathematics with Application 35(10), 15–23 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Antonoiu, G., Srimani, P.K.: Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 823–830. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-stabilizing local mutual exclusion and daemon refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Corteel, S., Valencia-Pabon, M., Vera, J.: On approximating the b-chromatic number. Discrete Applied Mathematics 146, 106–110 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discrete Mathematics and Theoretical Computer Science 6, 45–54 (2003)

    MathSciNet  MATH  Google Scholar 

  7. Effantin, B., Kheddouci, H.: A distributed algorithm for a b-coloring of a graph. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 430–438. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Elghazel, H., Kheddouci, H., Deslandres, V., Dussauchoy, A.: A new graph-based clustering approach: Application to pmsi data. In: IEEE International Conference on Services Systems and Services Management (ICSSSM 2006), France (2006)

    Google Scholar 

  9. Gairing, M., Goddard, W., Hedetniemi, S.T., Kristiansen, P., McRae, A.A.: Distance-two information in self-stabilizing algorithms. Parallel. Process. Lett. 14, 387–398 (2004)

    Article  MathSciNet  Google Scholar 

  10. Ghoch, S., Karaata, S.: A self-stabilizing algorithm for coloring planar graph. Distributed Computing 71, 55–59 (1993)

    MathSciNet  MATH  Google Scholar 

  11. Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Trevisan, V.: Distance-k knowledge in self-stabilizing algorithms. Theoretical Computer Science 399, 118–127 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. 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  MATH  Google Scholar 

  16. Irving, R.W., Manlove, D.F.: The b-chromatique number of a graph. Discrete Applied Mathematics 91, 127–141 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kouider, M., Maheo, M.: Some bounds for the b-chromatic number of a graph. Discrete Mathematics 256(1-2), 267–277 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kratochvil, J., Tuza, Z., Voigt, M.: On the b-chromatic number of graphs. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 310–320. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 254–268. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. LIESP, Université Lyon 1, IUTA, Département Informatique, Université de Lyon, 71 rue Peter Fink, F-01000, Bourg en Bresse, France

    Lyes Dekar

  2. Laboratoire LIESP, Université Lyon 1, Université de Lyon, Bât. Nautibus, 43 bd du 11 Novembre 1918, 69622, Villeurbanne Cedex, France

    Hamamache Kheddouci

Authors
  1. Lyes Dekar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamamache Kheddouci
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA

    Sandeep Kulkarni

  2. École Polytechnique Fédérale de Lausanne (EPFL), 1015, Lausanne, Switzerland

    André Schiper

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dekar, L., Kheddouci, H. (2008). Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs. In: Kulkarni, S., Schiper, A. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2008. Lecture Notes in Computer Science, vol 5340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89335-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89335-6_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89334-9

  • Online ISBN: 978-3-540-89335-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation