Distance-k information in self-stabilizing algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4056 LNCS, Issue , 2006, Pages 349-356

  Goddard, Wayne ^a   Hedetniemi, Stephen T ^a   Jacobs, David P ^a   Trevisan, Vilmar ^b  

^a AMRL   (United States)

^b FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; STABILIZATION;

DISTANCE-K INFORMATION; IRREDUNDANT SETS; POLYNOMIAL TRANSFORMATION; SELF-STABILIZING ALGORITHMS;

INFORMATION THEORY;

EID: 33746325499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780823_27     Document Type: Conference Paper

References (6)

1. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Comm. ACM 17 (11) (1974) 643-644
2. Dolev, S.: Self-Stabilization. MIT Press, 2000
3. Gairing, M., Goddard, W., Hedetniemi, S.T., Kristiansen, P., McRae, A.A.: Distance-two information in self-stabilizing algorithms, Parallel Process. Lett., 14 (2004) 387-398
4. Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing global optimization algorithms for large network graphs, Int. J. Dist. Sensor Net., 1 (2005) 329-344
5. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998
6. 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 (2003) 805-811