A distributed algorithm for constructing a minimum diameter spanning tree

Journal of Parallel and Distributed Computing

Volumn 64, Issue 5, 2004, Pages 571-577

  Bui, Marc ^a   Butelle, Franck ^b   Lavault, Christian ^b  

^a UNIVERSITÉ PARIS 8   (France)

^b Universite Paris   (France)

Author keywords

Absolute centres; All pairs shortest paths; Minimum diameter spanning trees; Shortest paths; Shortest paths trees; Spanning trees

Indexed keywords

ALGORITHMS; ASYNCHRONOUS MACHINERY; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

ABSOLUTE CENTRES; ALL-PAIR SHORTEST PATHS; MINIMUM DIAMETER SPANNING TREES; SHORTEST PATHS TREES; SHROTEST PATHS; SPANNING TREES;

TREES (MATHEMATICS);

EID: 4544293267     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.03.009     Document Type: Article

References (18)

1. Awerbuch B. Complexity of network synchronization. J. ACM. 32:1985;804-823.
2. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree counting, leader election and related problems, Proceedings of ACM STOC, 1987, pp. 230-240.
3. B. Awerbuch, I. Cidon, S. Kutten, Communication-optimal maintenance of replicated information, Proceedings of IEEE FOCS, 1990, pp. 492-502.
4. Bertsekas D., Gallager R. Data Networks. 2nd Edition: 1992; Prentice-Hall, Englewood Cliffs, NJ.
5. M. Bui, F. Butelle, Minimum diameter spanning tree, Proceedings of the International Workshop on Principles of Parallel Computing (OPOPAC'93), Hermès & Inria, Lacanau, France, 1993, pp. 37-46.
6. Camerini P.M., Galbiati G., Maffioli F. Complexity of spanning tree problems part I. Eur. J. Oper. Res. 5:1980;346-352.
7. Chandrasekaran S., Venkatesan S. A message optimal algorithm for distributed termination detection. J. Parallel Distributed Comput. 8:(3):1990;245-252.
8. Christophides N. Graph Theory: An Algorithmic Approach, Computer Science and Applied Mathematics. 1975;Academic Press, New York.
9. Eppstein D., Italiano G.F., Tamassia R., Tarjan R.E., Westbrook J., Yung M. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms. 13:1992;33-54.
10. P. Fraigniaud, C. Gavoille, Memory requirement for universal routing schemes, Technical Report, LIP 95-05, ENSL, 1995.
11. Gallager R.G., Humblet P.A., Spira P.M. A distributed algorithm for minimum weight spanning trees. ACM TOPLAS. 5:(1):1983;66-77.
12. Hakimi S.L., Pierce J.G., Schmeichel E.F. On p -centers in networks. Transport. Sci. 12:1978;1-15.
13. Ho J.-M, Lee D.T., Chang C.-H, Wong C.K. Minimum diameter spanning trees and related problems. SIAM J. Comput. 20:(5):1991;987-997.
14. E. Ihler, G. Reich, P. Widmayer, On shortest networks for classes of points in the plane, Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications, Lecture Notes in Computer Science, Springer, Berlin, 1991, pp. 103-111.
15. G.F. Italiano, R. Ramaswani, Maintaining spanning trees of small diameter, Proceedings of ICALP'94, 1994, pp. 227-238.
16. Lamport L. An assertional correctness proof of a distributed algorithm. Sci. Comput. Programm. 2:1982;175-206.
17. C. Lavault, Évaluation Des Algorithmes Distribués - Analyse, Complexité, Méthode, Hermès, 1995.
18. Lynch N. Distributed Algorithms. 1996;Morgan Kaufmann, Los Altos, CA.