Distance-two information in self-stabilizing algorithms

Parallel Processing Letters

Volumn 14, Issue 3-4, 2004, Pages 387-398

  Gairing, Martin ^a   Goddard, Wayne ^b   Hedetniemi, Stephen T ^b   Kristiansen, Petter ^c   McRae, Alice A ^d  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Clemson University   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

^d APPALACHIAN STATE UNIVERSITY   (United States)

Author keywords

Distance two; Dominating function; Packing; Self stabilizing algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING;

2-PACKING; DISTANCE TWO INFORMATION; DOMINATING FUNCTION; SELF-STABILIZING ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 21144439445     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626404001970     Document Type: Article

References (18)

1. J. Beauquier, A. K. Datta, M. Gradinariu, and F. Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium, Springer LNCS:1914, pages 223-237, 2000.
2. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17:643-644, 1974.
3. S. Dolev. Self-Stabilization. MIT Press, 2000.
4. S. Dolev, A. Israeli, and S. Moran. Uniform Dynamic Self-Stabilizing Leader Election. IEEE Trans. on Parallel and Distributed Systems, volume 8, no. 4, 1995.
5. G. S. Domke. Variations of Colorings, Coverings, and Packings of Graphs. PhD thesis, Clemson University, 1988.
6. G. S. Domke, S. T. Hedetniemi, R. C. Laskar, and G. Fricke. Relationships between integer and fractional parameters of graphs. In Y. Alavi et al. eds, Graph Theory, Combinatorics, and Applications, Proceedings of the Sixth Quadrennial Conference on the Theory and Applications of Graphs (Kalamazoo MI, 1988), volume 2, pages 371-387. Wiley, 1991.
7. M. Gairing, R. M. Geist, S. T. Hedetniemi, and P. Kristiansen. A self-stabilizing algorithm for maximal 2-packing. Nordic Journal of Computing, 11(1):1-11, 2004.
8. M. Gairing, S. T. Hedetniemi, P. Kristiansen, and A. A. McRae. A self-stabilizing algorithm for {k}-domination. In SSS03 Sixth International Symposium on Self-Stabilizing Systems, Springer LNCS 2704, pages 49-60, 2003
9. W. Goddard, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph. In Proceedings of the 8th International Workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA '03), 2003.
10. M. Gradinariu and C. Johnen. Self-stabilizing neighborhood unique naming under unfair scheduler. In Proceedings of Euro-Par'01 Parallel Processing, LNCS:2150, Springer, 2001, 458-465.
11. M. Gradinariu and S. Tixeuil. Self-stabilizing vertex coloration of arbitrary graphs. In 4th International Conference On Principles Of Distributed Systems, OPODIS'2000, Studia Informatica Universalis, 2000, 55-70.
12. J. R. Griggs and R. K. Yeh. Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5(4):586-595, 1992.
13. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, 1998.
14. S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Self-stabilizing algorithm for minimal dominating and maximal independent sets. Computers & Mathematics with Applications, 46(5-6):805-811, 2003.
15. S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Maximal matching stabilizes in time O(m). Information Processing Letters, 80(5):221-223, 2001.
16. Su-Chu Hsu and Shing-Tsaan Huang. A self-stabilizing algorithm for maximal matching. Information Processing Letters, 43(2):77-81, 1992.
17. G. Tel. Maximal matching stabilizes in quadratic time. Information Processing Letters, 49(6):271-272, 1994.
18. G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, second edition, 2000.