Self-stabilizing algorithms for finding centers and medians of trees

SIAM Journal on Computing

Volumn 29, Issue 2, 1999, Pages 600-614

  Bruell, Steven C ^a   Ghosh, Sukumar ^a   Karaata, Mehmet Hakan ^b   Pemmaraju, Sriram V ^c  

^a The University of Iowa   (United States)

^b Elec and Comp Eng Dept Kuwait   (Kuwait)

^c INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

SELF-STABILIZING ALGORITHMS;

TREES (MATHEMATICS);

EID: 0033298447     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798427156     Document Type: Article

References (34)

1. S. AGGARWAL AND S. KUTTEN, Time optimal self-stabilizing spanning tree algorithm, in Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 761, Springer-Verlag, New York, 1993, pp. 400-410.
2. B. AWERBUCH AND G. VARGHESE. Distributed program checking: a paradigm for building self-stabilizing distributed protocols, in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 258-267.
3. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, Elsevier, New York, 1976.
4. F. BUCKLEY AND F. HARARY, Distance in Graphs, Addison-Wesley, Advanced Book Program, Redwood City, CA, 1990.
5. J. E. BURNS AND J. PACHL, Uniform self-stabilizing rings, ACM Transactions on Programming Languages and Systems. 11 (1989), pp. 330-344.
6. N. S. CHEN, F. P. YU, AND S. T. HUANG, A self-stabilizing algorithm for constructing spanning trees, Inform. Process. Lett., 39 (1991), pp. 147-151.
7. Z. COLLIN AND S. DOLEV, Self-stabilizing depth-first search, Inform. Process. Lett., 49 (1994), pp. 297-301.
8. E. W. DIJKSTRA, Some beautiful arguments using mathematical induction, Acta Inform., 13 (1980), pp. 1-8.
9. S. DOLEV, A. ISRAELI, AND S. MORAN, Self-stabilization of dynamic systems assuming only read/write atomicity, in Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 103-118.
10. A. M. FARLEY, Vertex centers of trees, Transportation Science, 16 (1982), pp. 265-280.
11. A. M. FARLEY AND A. PROSKUROWSKI, Computation of the center and diameter of outerplanar graphs, Discrete Appl. Math., 2 (1980), pp. 185-191.
12. S. GHOSH, A. GUPTA, M. H. KARAATA, AND S. V. PEMMARAJU, Self-stabilizing dynamic programming algorithms on trees, in Proceedings of the 2nd Workshop on Self-Stabilizing Systems, 1995.
13. S. GHOSH, A. GUPTA, AND S. V. PEMMARAJU, A self-stabilizing algorithm for the maximum flow problem, Distrib. Comput., 10 (1997), pp. 8-14.
14. S. GHOSH AND M. H. KARAATA, A self-stabilizing algorithm for coloring planar graphs, Distrib. Comput., 7 (1993), pp. 55-59.
15. A. J. GOLDMAN, Minimax location of a facility in a network, Transportation Science, 6 (1972), pp. 407-418.
16. M. G. GOUDA AND M. SCHNEIDER, Maximum flow routing, in Proceedings of the 2nd Workshop on Self-Stabilizing Systems, 1995.
17. F. HARARY, Graph Theory, Addison-Wesley, Reading, MA, 1972.
18. S. M. HEDETNIEMI, E. J. COCKAYNE, AND S. T. HEDETNIEMI, Linear algorithms for finding the jordan center and path center of a tree, Transportation Science, 15 (1981), pp. 98-114.
19. T. HERMAN, Probabilistic self-stabilization, Inform. Process. Lett., 35 (1990), pp. 63-67.
20. S. C. HSU AND S. T. HUANG, A self-stabilizing algorithm for maximal matching, Inform. Process. Lett., 43 (1992), pp. 77-81.
21. S. T. HUANG, Leader election in uniform rings, ACM Transactions on Programming Languages and Systems, 15 (1993), pp. 563-573.
22. A. ISRAELI AND M. JALFON, Token management schemes and random walks yield self-stabilizing mutual exclusion, in Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 119-132.
23. M. H. KARAATA, S. V. PEMMARAJU, S. C. BRUELL, AND S. GHOSH, Self-Stabilizing Algorithms for Finding Centers and Medians of Trees, Technical Report, TR 94-03, University of Iowa, Iowa City, IA, 1994.
24. O. KARIV AND S. L. HAKIMI, An algorithmic approach to network location problems. I: The p-centers, SIAM J. Appl. Math., 37 (1979), pp. 513-538.
25. O. KARIV AND S. L. HAKIMI, An algorithmic approach to network location problems. II: The p-medians, SIAM J. Appl. Math., 37 (1979), pp. 539-560.
26. S. KATZ AND K. J. PERRY, Self-stabilizing extensions for message passing systems, in Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 91-101.
27. E. KORACH, D. ROTEM, AND N. SANTORO, Distributed algorithms for finding centers and medians in networks, ACM Transactions on Programming Languages and Systems, 6 (1984), pp. 380-401.
28. H. S. M. KRUIJER, Self-stabilization (in spite of distributed control) in tree-structured systems, Inform. Process. Lett., 8 (1979), pp. 91-95.
29. R. LASKAR AND D. SHIER, On powers and centers of chordal graphs, Discrete Appl. Math., 6 (1983), pp. 139-147.
30. X. LIN AND S. GHOSH, Self-stabilizing maxima finding, in Proceedings of the 28th Annual Allerton Conference, 1991, pp. 662-671.
31. A. ROSENTHAL AND J. PINO, A generalized algorithm for centrality problems on trees, J. ACM, 36 (1989), pp. 349-361.
32. M. SCHNEIDER, Self-stabilization, ACM Computing Surveys, 25 (1993), pp. 45-67.
33. S. K. SHUKLA, D. J. ROSENKRANTZ, AND S. S. RAVI, Observations of self-stabilizing graph algorithms for anonymous networks, in Proceedings of the 2nd Workshop on Self-Stabilizing Systems, 1995.
34. S. SUR AND P. K. SRIMANI, A self-stabilizing distributed algorithm for BFS spanning trees of a symmetric graph, Parallel Process. Lett., 2 (1992), pp. 171-179.