A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing

Volumn 70, Issue 4, 2010, Pages 406-415

  Guellati, Nabil ^a   Kheddouci, Hamamache ^b  

^a UNIVERSITY OF BEJAIA   (Algeria)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

Coloring; Distributed algorithm; Domination; Graph algorithm; Independence; Matching; Self stabilization

Indexed keywords

DIJKSTRA; DISTRIBUTED ALGORITHM; DISTRIBUTED SYSTEMS; FINITE TIME; GRAPH ALGORITHM; GRAPH ALGORITHMS; GRAPH-THEORETIC PROBLEM; INDEPENDENT SET PROBLEMS; INITIAL STATE; MATCHINGS; SELF-STABILIZATION; SELF-STABILIZING ALGORITHM;

COLORING; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; MULTICASTING; NETWORK PROTOCOLS; QUALITY ASSURANCE; STABILIZATION; SURVEYS;

ALGORITHMS;

EID: 76849083909     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2009.11.006     Document Type: Article

References (69)

1. Bruell S.C., Ghosh S., Karaata M.H., and Pemmaraju S.V. Self-stabilizing algorithms for finding centers and medians of trees. SIAM Journal on Computing 29 2 (1999) 600-614
2. S. Cantarell, A.K. Datta, F. Petit, Self-stabilizing atomicity refinement allowing neighborhood concurrency, in: Proc. 6th International Symposium on Self-Stabilizing Systems, 2003, pp. 102-112
3. S. Chattopadhyay, L. Higham, K. Seyffarth, Dynamic and self-stabilizing distributed matching, in: Proc. 21st ACM Symposium on Principles of Distributed Computing, 2002, pp. 290-297
4. P. Chaudhuri, H. Thompson, A self-stabilizing algorithm for L(2,1)-labeling trees, in: Proc. IASTED International Conference on Parallel and Distributed Computing and Networks, 2005, pp. 627-632
5. Datta A.K., Larmore L.L., and Vemula P. A self-stabilizing O(k)-time k-clustering algorithm. Computer Journal (2009)
6. L. Dekar, H. Kheddouci, Distance-2 self-stabilizing algorithm for a b-coloring of graphs, in: Proc. 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2008, pp. 19-31
7. Diestel R. Graph Theory. third edition (2005), Springer-Verlag
8. Dijkstra E.W. Self-stabilizing systems in spite of distributed control. Communication of the ACM 17 11 (1974) 643-644
9. Dolev S. Self-stabilization (2000), MIT Press
10. Dolev S. Self-stabilizing routing and related protocols. Journal of Parallel and Distributed Computing 42 2 (1997) 122-127
11. Dolev S., and Herman T. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science 1997 (1997)
12. Dolev S., Israeli A., and Moran S. Resource bounds for self-stabilizing message-driven protocols. SIAM Journal on Computing 26 1 (1997) 273-290
13. Dolev S., Israeli A., and Moran S. Self stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing 7 1 (1993) 3-16
14. Dolev S., and Tzachar N. Empire of colonies: Self-stabilizing and self-organizing distributed algorithm. Theoretical Computer Science 410 6-7 (2009) 514-532
15. F.C. Gartner, A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms, Swiss Federal Institute of Technology Tech. Rep. IC/2003/38, School of Computer and Communication Sciences, Lausanne, Switzerland, 2003
16. Gavoille C., Klasing R., Kosowski A., Kuszner L., and Navarra A. On the complexity of distributed graph coloring with local minimality constraints. Networks 54 1 (2009) 12-19
17. S. Ghosh, A. Gupta, T. Herman, S.V. Pemmaraju, Fault-containing self-stabilizing algorithms, in: Proc. 15th ACM Symposium on Principles of Distributed Computing, 1996
18. Ghosh S., and Karaata M.H. A self-stabilizing algorithm for coloring planar graphs. Distributed Computing 7 (1993) 55-59
19. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, A robust distributed generalized matching protocol that stabilizes in linear time, in: Proc. 23rd International Conference on Distributed Computing Systems Workshops, 2003, pp. 461-465
20. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph, in: Proc. 17th International Parallel and Distributed Processing Symposium, 2003
21. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, Self-stabilizing distributed algorithm for strong matching in a system graph, in: Proc. 10th International Conference on High Performance Computing, 2003
22. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks, in: Proc. International Parallel and Distributed Processing Symposium, 2003
23. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, Fault tolerant algorithms for orderings and colorings, in: Proc. 18th International Parallel and Distributed Processing Symposium, 2004, pp. 174-182
24. Goddard W., Hedetniemi S.T., Jacobs D.P., Srimani P.K., and Xu Z. Self-stabilizing graph protocols. Parallel Processing Letters 18 1 (2008) 189-199
25. W. Goddard, S.T. Hedetniemi, Z. Shi, An anonymous self-stabilizing algorithm for 1-maximal matching in trees, in: Proc. International Conference on Parallel and Distributed Processing Techniques and Applications, 2006, pp. 797-803
26. M. Gradinariu, S. Tixeuil, Self-stabilizing vertex coloration and arbitrary graphs, in: Proc. 4th International Conference on Principles of Distributed Systems, 2000, pp. 55-70
27. Haynes T.W., Hedetniemi S.T., and Slater P.J. Fundamentals of Domination in Graphs (1998), Marcel Dekker
28. Hedetniemi S.M., Hedetniemi S.T., Jacobs D.P., and Srimani P.K. Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Computer Mathematics and Applications 46 5-6 (2003) 805-811
29. Hedetniemi S.T., Jacobs D.P., and Srimani P.K. Maximal matching stabilizes in time O (m). Information Processing Letters 80 5 (2001) 221-223
30. Hedetniemi S.T., Jacobs D.P., and Srimani P.K. Linear time self-stabilizing colorings. Information Processing Letters 87 (2003) 251-255
31. Herman T. Self-stabilization bibliography: Access guide, Working Paper WP-1. Chicago Journal of Theoretical Computer Science (2002)
32. Hsu S.C., and Huang S.T. A self-stabilizing algorithm for maximal matching. Information Processing Letters 43 2 (1992) 77-81
33. Huang S.T., Hung S.S., and Tzeng C.H. Self-stabilizing coloration in anonymous planar networks. Information Processing Letter 95 (2005) 307-312
34. S.T. Huang, C.H. Tzeng, Distributed edge coloration for bipartite networks, in: Proc. 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS'06, 2006, pp. 363-377
35. S.T. Huang, Y.H. Wang, Self-stabilizing acyclic coloring of graphs, in: Proc. IASTED International Conference on Parallel and Distributed Computing and Networks, 2004
36. Huang T.C., Chen C.Y., and Wang C.P. A linear-time self-stabilizing algorithm for the minimal 2-dominating set problem in general networks. Journal of Information Science and Engineering 24 1 (2008) 175-187
37. Huang T.C., Lin J.C., Chen C.Y., and Wang C.P. A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model. Computers & Mathematics with Applications 54 3 (2007) 350-356
38. M. Ikeda, S. Kamei, H. Kakugawa, A space-optimal self-stabilizing algorithm for the maximal independent set problem, in: Proc. 3rd International Conference on Parallel and Distributed Computing, Applications and Technologies, 2002
39. A. Jain, A. Gupta, A distributed self-stabilizing algorithm for finding a connected dominating set in a graph, in: Proc. 6th International Conference on Parallel and Distributed Computing Applications and Technologies, 2005, pp. 615-619
40. H. Kakugawa, T. Masuzawa, A self-stabilizing minimal dominating set algorithm with safe convergence, in: Proc. 20th International Parallel and Distributed Processing Symposium, 2006
41. S. Kamei, H. Kakugawa, A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree network, in: Proc. 4th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2003
42. Kamei S., and Kakugawa H. A self-stabilizing approximation algorithm for the distributed minimum k-domination. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E88-A 5 (2005) 1109-1116
43. S. Kamei, H. Kakugawa, A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, in: Proc. 21st International Parallel and Distributed Processing Symposium, 2007, pp. 1-8
44. Karaata M.H. Self-stabilizing strong fairness under weak fairness. IEEE Transactions on Parallel and Distributed Systems 12 4 (2001) 337-345
45. Karaata M.H., and Saleh K.A. A distributed self-stabilizing algorithm for finding maximum matching. Computer Systems Science and Engineering 15 3 (2000) 175-180
46. A. Kosowski, L. Kuszner, Self-stabilizing algorithms for graph coloring with improved performance guarantees, in: Proc. 8th International Conference on Artificial Intelligence and Soft Computing, 2006, pp. 1150-1159
47. J. Kratochvil, Z. Tuza, M. Voigt, On the b-chromatic number of graphs, in: Proc. 28th International on Graph-Theoretic Concepts in Computer Science, 2002, pp. 310-320
48. F. Kuhn, T. Moscibroda, R. Wattenhofer, What cannot be computed locally! in: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, 2004, pp. 300-309
49. Lin J.C., and Huang T.C. An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set. IEEE Transactions on Parallel and Distributed Systems 14 8 (2003) 742-754
50. Lin J.C., Huang T.C., Wang C.P., and Chen C.Y. A self-stabilizing algorithm for finding a minimal distance-2 dominating set in distributed systems. Journal of Information Science and Engineering 24 6 (2008) 1709-1718
51. Linial N. Locality in distributed graph algorithms. SIAM Journal on Computing 21 (1992) 193-201
52. F. Manne, M. Mjelde, A self-stabilizing weighted matching algorithm, in: Proc. 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2007, pp. 383-393
53. F. Manne, M. Mjelde, L. Pilard, S. Tixeuil, A new self-stabilizing maximal matching algorithm, in: Proc. 14th International Colloquium on Structural Information and Communication Complexity, 2007, pp. 96-108
54. F. Manne, M. Mjelde, L. Pilard, S. Tixeuil, A self-stabilizing 2/3-approximation algorithm for the maximum matching problem, in: Proc. 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2008
55. T. Masuzawa, S. Tixeuil, A self-stabilizing link coloring algorithm resilient to unbounded byzantine faults in arbitrary networks, in: Proc. 9th International Conference on Principles of Distributed Systems, December 2005
56. Nesterenko M., and Arora A. Stabilization-preserving atomicity refinement. Journal of Parallel and Distributed Computing 62 5 (2002) 766-791
57. M. Nesterenko, A. Arora, Tolerance to unbounded byzantine faults, in: Proc. 21st IEEE Symposium on Reliable Distributed Systems, 2002
58. Y. Sakurai, F. Ooshita, T. Masuzawa, A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks, in: Proc. 8th International Conference on Principles of Distributed Systems, 2004
59. Schneider M. Self-stabilization. ACM Computing Surveys 25 1 (1993) 45-67
60. Shi Z., Goddard W., and Hedetniemi S.T. An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Information Processing Letters 91 2 (2004) 77-83
61. S.K. Shukla, D.J. Rosenkrantz, S.S. Ravi, Developing self-stabilizing coloring algorithms via systematic randomization, in: Proc. 1st International Workshop on Parallel Processing, 1994, pp. 668-673
62. S.K. Shukla, D.J. Rosenkrantz, S.S. Ravi, Observations on self-stabilizing graph algorithms for anonymous networks, in: Proc. 2nd Workshop on Self-Stabilizing Systems, 1995
63. P.K. Srimani, Z. Xu, Self-stabilizing algorithms of constructing spanning tree and weakly connected minimal dominating set, in: Proc. 27th International Conference on Distributed Computing Systems Workshops, 2007
64. H. Sun, B. Effantin, H. Kheddouci, A self-stabilizing algorithm for the minimum color sum of a graph, in: Proc. 9th International Conference on Distributed Computing and Networking, 2008, pp. 209-214
65. Sur S., and Srimani P.K. A self-stabilizing algorithm for coloring bipartite graphs. Information Sciences 69 (1993) 219-227
66. Tel G. Maximal matching stabilizes in quadratic time. Information Processing Letters 49 6 (1994) 271-272
67. Turau V. Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Information Processing Letters 103 3 (2007) 88-93
68. Tzeng C.H., Jiang J.R., and Huang S.T. A self-stabilizing (Δ + 4)-edge-coloring algorithm for planar graphs in anonymous uniform systems. Information Processing Letters 101 4 (2007) 168-173
69. Z. Xu, S.T. Hedetniemi, W. Goddard, P.K. Srimani, A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph, in: Proc. 5th International Workshop on Distributed Computing, 2003