skip to main content
10.1145/383962.383984acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

Distributed MST for constant diameter graphs

Published:01 August 2001Publication History

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).

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.M. Li and P.M.B. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.N. Linial, Locality in distributed graph algorithms, SIAM J. on Computing Vol. 21, (1992), 193-201. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.D. Peleg, Time-optimal leader election in general networks, Journal of Parallel and Distributed Computing, Vol. 8, (1990), 96-99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm, J. of Algorithms Vol. 3, (1982), 57-67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle Scholar

Index Terms

  1. Distributed MST for constant diameter graphs

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
            August 2001
            323 pages
            ISBN:1581133839
            DOI:10.1145/383962

            Copyright © 2001 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 August 2001

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            PODC '01 Paper Acceptance Rate39of118submissions,33%Overall Acceptance Rate740of2,477submissions,30%

            Upcoming Conference

            PODC '24

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader