Self-stabilizing algorithms for minimal dominating sets and maximal independent sets

Computers and Mathematics with Applications

Volumn 46, Issue 5-6, 2003, Pages 805-811

  Hedetniemi, S M ^a   Hedetniemi, S T ^a   Jacobs, D P ^a   Srimani, P K ^a  

^a AMRL   (United States)

Author keywords

Dominating set; Graph; Independent set; Self stabilizing algorithm

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY;

DOMINATING SET; INDEPENDENT SET; SELF STABILIZING ALGORITHM;

ALGORITHMS;

EID: 0242667518     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(03)90143-X     Document Type: Article

References (16)

1. E.W. Dijkstra Self-stabilizing systems in spite of distributed control, Comm. ACM 17 (11), 643-644, (1974).
2. E.W. Dijkstra, A belated proof of self-stabilization, J. of Distributed Computing 1, 5-6, (1986).
3. G. Antonoiu and P.K. Srimani A self-stabilizing distributed algorithm to find the center of a tree graph, Parallel Algorithms and Applications 10, 237-248, (1997).
4. G. Antonoiu and P.K. Srimani, A self-stabilizing distributed algorithm to find the median of a tree graph, J. Comput. Sys. Sci. 58, 215-221, (1999).
5. S.-C. Hsu and S.-T. Huang, A self-stabilizing algorithm for maximal matching, Inform. Process. Lett. 43, 77-81, (1992).
6. G. Tel, Maximal matching stabilizes in quadratic time, Information Processing Letters 49, 271-272, (1994).
7. S.T. Hedetniemi, D.P. Jacobs and P.K. Srimani, Maximal matching stabilizes in time O(m), Inform. Process. Lett. 80, 221-223, (2001).
8. S. Ghosh and M.H. Karaata, A self-stabilizing algorithm for coloring planar graphs, Distributed Comput. 7, 55-59, (1993).
9. S. Sur and P.K. Srimani, A self-stabilizing algorithm for coloring bipartite graphs Inform. Sci. 69, 219-227, (1993).
10. M.S Tsai and S.T. Huang, A self-stabilizing algorithm for the shortest paths problem with a fully distributed demon, Parallel Process. Lett. 4, 65-72, (1994).
11. S. Chandrasekar and P.K. Srimani A self-stabilizing distributed algorithm for all-pairs shortest path problem, Parallel Algorithms and Applications 4, 125-137, (1994).
12. P. Chaudhuri, A note on self-stabilizing articulation point detection, J. Systems Arch. 45, 1249-1252, (1999).
13. G. Antonoiu and P.K. Srimani, A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph, Computers Math. Applic. 30 (9), 1-7, (1995).
14. S. Sur and P.K. Srimani, A self-stabilizing distributed algorithm to construct BFS spanning trees of a symmetric graph, Parallel Process. Lett. 2, 171-179, (1992).
15. T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, (1998).
16. T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Editors, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, (1998).