A sublinear time distributed algorithm for minimum-weight spanning trees

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 302-316

  Garay, Juan A ^a,b   Kutten, Shay ^a   Peleg, David ^a,b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Distributed algorithms; Min weight spanning trees; MST

Indexed keywords

EID: 0000601523     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794261118     Document Type: Article

References (20)

1. I. ALTHÖFER, G. DAS, D. DOBKIN, AND D. JOSEPH, Generating sparse spanners for weighted graphs, in Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 447, Springer-Verlag, New York, 1990, pp. 26-37.
2. B. AWERBUCH, Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems, in Proc. 19th ACM Symp. on Theory of Computing, ACM, New York, 1987, pp. 230-240.
3. B. AWERBUCH, Complexity of network synchronization, J. ACM, 32 (1985), pp. 804-823.
4. B. AWERBUCH, A. GOLDBERG, M. LUBY, AND S. PLOTKIN, Network decomposition and locality in distributed computation, in Proc. 30th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 364-375.
5. B. AWERBUCH, O. GOLDREICH, D. PELEG, AND R. VAINISH, A tradeoff between information and communication in broadcast protocols, J. ACM, 37 (1990), pp. 238-256.
6. B. AWERBUCH, S. KUTTEN, AND D. PELEG, Competitive distributed job load balancing, Proc. 24th ACM Symp. on Theory of Computing, ACM, New York, 1992, pp. 571-580.
7. B. AWERBUCH AND D. PELEG, Network synchronization with polylogarithmic overhead, in 31st IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 514-522.
8. B. AWERBUCH AND D. PELEG, Concurrent online tracking of mobile users, Proc. ACM SIGCOMM Symposium on Communication, Architectures and Protocols, ACM, New York, 1991, pp. 221-233.
9. B. BOLLOBÁS, Extremal Graph Theory, Academic Press, New York, 1978.
10. F. CHIN AND H. F. TING, An almost linear time and O(n log(n) + e) messages distributed algorithm for minimum-weight spanning trees, in Proc. 26th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 257-266.
11. E. GAFNI, Improvements in the time complexity of two message-optimal election algorithms, in Proc. 4th Symp. on Principles of Distributed Computing, ACM, New York, 1995, pp. 175-185.
12. R. GALLAGER, P. HUMBLET, AND P. SPIRA, A distributed algorithm for minimum-weight spanning trees, in ACM Trans. Programming Lang. Systems, 5 (1983), pp. 66-77.
13. J. GARAY, S. KUTTEN, AND D. PELEG, A sub-linear time distributed algorithm for minimum-weight spanning trees, in Proc. 34th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 659-668.
14. A. V. GOLDBERG, S. PLOTKIN, AND G. SHANNON, Parallel symmetry breaking in sparse graphs, in Proc. 19th ACM Symp. on Theory of Computing, ACM, New York, 1987, pp. 315-324.
15. N. LINIAL, Distributive graph algorithms - global solutions from local data, in Proc. 28th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 331-335.
16. J. M. MCQUILLAN, I. RICHER, AND E. C. ROSEN, The new routing algorithm for the ARPANET, IEEE Trans. Comm., COM-28 (1980), pp. 711-719.
17. D. PELEG, Time-optimal leader election in general networks, J. Parallel Distrib. Comput., 8 (1990), pp. 96-99.
18. D. PELEG AND A. A. SCHAFFER, Graph spanners, J. Graph Theory, 13 (1989), pp. 99-116.
19. A. PANCONESI AND A. SRINIVASAN, Improved distributed algorithms for coloring and network decomposition problems, in Proc. 24th ACM Symp. on Theory of Computing, ACM, New York, 1992, pp. 581-592.
20. R. E. TARJAN, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983.