Advertisement

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

  • Lyes Dekar
  • Hamamache Kheddouci
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

b-coloring self-stabilizing algorithm clustering data mining graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 4.
    Corteel, S., Valencia-Pabon, M., Vera, J.: On approximating the b-chromatic number. Discrete Applied Mathematics 146, 106–110 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. ACM 17(11), 643–644 (1974)CrossRefzbMATHGoogle Scholar
  6. 6.
    Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discrete Mathematics and Theoretical Computer Science 6, 45–54 (2003)MathSciNetzbMATHGoogle Scholar
  7. 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)CrossRefGoogle Scholar
  8. 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. 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)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Ghoch, S., Karaata, S.: A self-stabilizing algorithm for coloring planar graph. Distributed Computing 71, 55–59 (1993)MathSciNetzbMATHGoogle Scholar
  11. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 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. 13.
    Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Linear time self-stabilizing colorings. Information Processings Letters 87, 251–255 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Hsi, S.-C., Huang, S.-T.: A self-stabilizing algorithm for maximal matching. Information Processing Letters 43(2), 77–81 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Huang, S.-T., Hung, S.-S., Tzeng, C.-H.: Self-stabilizing coloration in anonymous planar networks. Information Processing Letters 95, 307–312 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Irving, R.W., Manlove, D.F.: The b-chromatique number of a graph. Discrete Applied Mathematics 91, 127–141 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kouider, M., Maheo, M.: Some bounds for the b-chromatic number of a graph. Discrete Mathematics 256(1-2), 267–277 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 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)CrossRefGoogle Scholar
  19. 19.
    Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 254–268. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  20. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 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. 22.
    Sur, S., Srimiani, P.K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Science 69, 217–219 (1993)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Lyes Dekar
    • 1
  • Hamamache Kheddouci
    • 2
  1. 1.Lab. LIESP, Université Lyon 1, IUTA, Département InformatiqueUniversité de LyonBourg en BresseFrance
  2. 2.Laboratoire LIESP, Université Lyon 1Université de LyonVilleurbanne CedexFrance

Personalised recommendations