Efficient self-stabilizing algorithms for tree networks

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2003, Pages 20-26

  Blair, Jean R S ^a   Manne, Fredrik ^b  

^a UNITED STATES MILITARY ACADEMY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; THEOREM PROVING;

SELF-STABILIZING ALGORITHMS; TREE NETWORKS; TREE-ROOTING ALGORITHMS;

ALGORITHMS;

EID: 0037968890     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. G. Antonoiu and P. K. Srimani. A self-stabilizing leader election algorithm for tree graphs. Journal of Parallel and Distributed Computing, 34:227-232, 1996.
2. 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.
3. 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.
4. J. R. S. Blair, S. M. Hedetniemi, S. T. Hedetniemi, and D. P. Jacobs. Self-stabilizing maximum matchings. Congressus Numerantium, 153:1521-1529, 2001.
5. J. R. S. Blair and F. Manne. Efficient self-stabilizing algorithms for tree networks. Technical Report 232, Department of Informatics, University of Bergen, Norway, 2002. Available athttp://www.ii.uib.no/publikasjoner/texrap/index.shtml.
6. S. C. Bruell, S. Ghosh, M. H. Karaata, and S. V. Pemmaraju. Self-stabilizing algorithms for finding centers and medians of trees. SIAM Journal on Computing, 29:600-614, 1999.
7. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. CACM, 17(11):643-644, 1974.
8. S. Ghosh, A. Gupta, M. H. Karaata, and S. V. Permmaraju. Self-stabilizing dynamic programming algorithms on trees. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 11.1-11.15, 1995.
9. F. Harary. Graph Theory. Addison-Wesley, 1972.
10. T. C. Huang, J. C. Lin, and H. J. Chen. A self-stabilizing algorithm which finds a 2-center of a tree. Computers and Mathematics with Applications, 40(4-5):607-624, 2000.
11. M. H. Karaata, S. V. Permmaraju, S. Ghosh, and A. Gupta. Self-stabilizing algorithms and dynamic programming. Journal of Parallel and Distributed Computing, under revision.
12. M. H. Karaata and K. A. Saleh. A Self-stabilizing algorithm for maximum matching in trees. In Proceedings of the Joint Conference of Information Sciences, pages 113-116, 1996.
13. M. H. Karaata and K. A. Saleh. A distributed self-stabilizing algorithm for maximum matching. Computer Systems Science and Engineering, pages 175-180, 2000.
14. S. Mitchell, E. Cockayne, and S. Hedetniemi. Linear algorithms on recursive representations of trees. J. Comput. Systems Sci., 18(1):76-85, 1979.