ABSTRACT
This paper considers the problem of distributively constructing a minimum-weight spanning tree (MST) for graphs of constant diameter in the bounded-messages model, where each message can contain at most B bits for some parameter B. It is shown that the time required to compute an MST for graphs of diameter 4 or 3 can be as high as Ω(3√n/B) and Ω(4√n/2√B), respectively. The lower bound holds even if the algorithm is allowed to be randomized. On the other hand, it is shown that O(log n) time units suffice to compute an MST deterministically for graphs with diameter 2, when B = O(log n). These results complement a previously known lower bound of Ω(2√n/B) for graphs of diameter Ω(log n).
- 1.B. Awerbuch, Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems, Proc. 19th Syrup. on Theory of Computing, pp. 230-240, May 1987. Google ScholarDigital Library
- 2.R. Gallager, P. Humblet and P. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions on Programming Languages and Systems, Vol. 5 (1), (1983), 66-77. Google ScholarDigital Library
- 3.J. Garay, S. Kutten and D. Peleg, A sub-linear time distributed algorithm for minimumweight spanning trees, SIAM J. on Computing Vol. 27, (1998), 302-316. Google ScholarDigital Library
- 4.S. Kutten and D. Peleg, Fast distributed construction of small k-dominating sets and applications, .t. of Algorithms, Vol. 28, (1998), 40-66. Google ScholarDigital Library
- 5.M. Li and P.M.B. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, 1993. Google ScholarDigital Library
- 6.N. Linial, Locality in distributed graph algorithms, SIAM J. on Computing Vol. 21, (1992), 193-201. Google ScholarDigital Library
- 7.D. Peleg, Time-optimal leader election in general networks, Journal of Parallel and Distributed Computing, Vol. 8, (1990), 96-99. Google ScholarDigital Library
- 8.D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000. Google ScholarDigital Library
- 9.D. Peleg and V. Rubinovich, A near-tight lower bound on the time complexity of distributed MST construction, SIAM J. on ComputingVol. 30, (2000), 1427-1442. Google ScholarDigital Library
- 10.Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm, J. of Algorithms Vol. 3, (1982), 57-67. Google ScholarDigital Library
- 11.A. Yao, Probabilistic computations: Towards a unified measure of complexity, Proc. 17th IEEE Symp. on Foundations of Computer Science, pages 222-227. Comp. Soc. IEEE, April 1977.Google Scholar
Index Terms
Distributed MST for constant diameter graphs
Recommendations
Distributed MST for constant diameter graphs
This paper considers the problem of distributively constructing a minimum-weight spanning tree (MST) for graphs of constant diameter in the bounded-messages model, where each message can contain at most B bits for some parameter B. It is shown that the ...
Streaming Euclidean MST to a Constant Factor
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of ComputingWe study streaming algorithms for the fundamental geometric problem of computing the cost of the Euclidean Minimum Spanning Tree (MST) on an n-point set X ⊂ ℝd. In the streaming model, the points in X can be added and removed arbitrarily, and the goal ...
Fast Distributed Algorithms for Connectivity and MST in Large Graphs
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesMotivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where k ≥ 2 machines jointly ...
Comments