Distributed MST for constant diameter graphs

Distributed Computing

Volumn 18, Issue 6, 2006, Pages 453-460

  Lotker, Zvi ^a   Patt Shamir, Boaz ^a   Peleg, David ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Distributed algorithm; Minimum weight spanning tree

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

DISTRIBUTED ALGORITHMS; LOWER BOUND; MINIMUM-WEIGHT SPANNING TREE;

GRAPH THEORY;

EID: 33744724964     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0127-6     Document Type: Article

References (21)

1. Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM 42(1), 124-142 (1995)
2. Attiya, H., Welch, J.: Distributed Algorithms. McGraw-Hill Publishing Company, UK (1998)
3. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In: Proceedings of 19th ACM Symposium Theory of Computing, pp. 230-240 (May 1987)
4. Awerbuch, B., Shiloach, Y.: New connectivity and MSF algorithms for the shuffle-exchange network and PRAM. IEEE Trans. Comput. C-36, 1258-1263 (1987)
5. Elkin, M.: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In Proceedings of 36th ACM Symposium on Theory of Computing (May 2004)
6. Faloutsos, M., Molle, M.: Optimal distributed algorithm for minimum spanning trees revisited. In: Proceedings of 14th ACM Symposium on Principles of Distributed Computing, pp. 231-237 (1995)
7. Fortune, S., Wyllie, J.: Parallelism in random access machines. In: Proceedings of 19th ACM Symposium on Theory of Computing, pp. 230-240 (May 1987)
8. Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Prog. Lang. Syst. 5(1), 66-77 (1983)
9. Garay, T., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27, 302-316 (1998)
10. Gifford, D.K.: Weighted Voting for Replicated Data. In: Proceedings of 7th Symposium on Operating System Principles, pp. 150-162 (1979)
11. Kutten, S., Peleg, D.: Fast distributed construction of small k-dominating sets and applications. J. Algorithm. 28, 40-66 (1998)
12. Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)
13. Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21, 193-201 (1992)
14. Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: MST construction in O(log log n) communication rounds. In: Proceedings of 2003 ACM Symposium on Parallelism in Algorithms and Architecture, pp. 94-100 (2003)
15. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Mateo, CA (1995)
16. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)
17. Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8, 96-99 (1990)
18. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)
19. Peleg, D., Rubinovich, V.: Near-tight lower bound on the time complexity of distributed MST construction. SIAM J. Comput. 30, 1427-1442 (2000)
20. Upfal, E., Wigderson, A.: How to share memory in a distributed system. J. ACM 34(1), 116-127 (1987)
21. Yao, A.C.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of 18th ACM Symposium on Theory of Computing, pp. 222-227 (1977)