An anonymous self-stabilizing algorithm for 1-maximal independent set in trees

Information Processing Letters

Volumn 91, Issue 2, 2004, Pages 77-83

  Shi, Zhengnan ^a   Goddard, Wayne ^a   Hedetniemi, Stephen T ^a  

^a AMRL   (United States)

Author keywords

Distributed computing; Fault tolerance; Graph algorithms; Maximal independent set

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; THEOREM PROVING; TOPOLOGY; TREES (MATHEMATICS);

GRAPH ALGORITHMS; MAXIMAL INDEPENDENT SETS;

DATA PROCESSING;

EID: 2942618976     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.03.010     Document Type: Article

References (13)

1. Awerbuch B., Goldberg A.V., Luby M., Plotkin S.A. Network decomposition and locality in distributed computation. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. 1989;364-369.
2. Bollobás B., Cockayne E.J., Mynhardt C.M. On generalized minimal domination parameters for paths. Discrete Math. 86:(1-3):1990;89-97.
3. Dijkstra E.W. Self-stabilizing systems in spite of distributed control. Comm. ACM. 17:(11):January 1974;643-644.
4. Dolev S. Self-Stabilization. 2000;MIT Press, Cambridge, MA.
5. G.S. Domke, Variations of colorings, coverings and packings of graphs, PhD thesis, Clemson University, Clemson, SC, 1988.
6. Ghosh S., Gupta A., Karaata M., Pemmaraju S. Self-stabilizing dynamic programming algorithms on trees. Proceedings of the Second Workshop on Self-Stabilizing Systems. 1995;11.1-11.15.
7. Hedetniemi S.M., Hedetniemi S.T., Jacobs D.P., Srimani P.K. Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Comput. Math. Appl. 46:(5-6):2003;805-811.
8. Hsu S.-C., Huang S.-T. A self-stabilizing algorithm for maximal matching. Inform. Process. Lett. 43:1992;77-81.
9. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15:(4):1986;1036-1053.
10. Panconesi A., Srinivasan A. The local nature of δ -coloring and its algorithmic applications. Combinatorica. 15:1995;225-280.
11. Rajagopalan S., Vazirani V. Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28:1998;525-540.
12. Shukla S., Rosenkrantz D., Ravi S. Observations on self-stabilizing graph algorithms for anonymous networks. Proceedings of the Second Workshop on Self-Stabilizing Systems. 1995;7.17.15.
13. Tel G. Introduction to Distributed Algorithms. second ed. 2000;Cambridge Univ. Press, Cambridge, UK.