Sub-linear time distributed algorithm for minimum-weight spanning trees

Juan A. Garay, Shay Kutten, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

36 Scopus citations

Abstract

This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network's diameter Diam. This is demonstrated in the paper by providing a distributed Minimum-weight Spanning Tree algorithm whose time complexity is sub-linear in n, but linear in Diam (specifically, O(Diam+n0.614)). Our result is achieved through the application of graph decomposition and edge elimination techniques that may be of independent interest.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundatons of Computer Science (Proceedings)
Editors Anon
PublisherPubl by IEEE
Pages659-668
Number of pages10
ISBN (Print)0818643706
StatePublished - 1993
Externally publishedYes
EventProceedings of the 34th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA
Duration: 3 Nov 19935 Nov 1993

Publication series

NameAnnual Symposium on Foundatons of Computer Science (Proceedings)
ISSN (Print)0272-5428

Conference

ConferenceProceedings of the 34th Annual Symposium on Foundations of Computer Science
CityPalo Alto, CA, USA
Period3/11/935/11/93

Fingerprint

Dive into the research topics of 'Sub-linear time distributed algorithm for minimum-weight spanning trees'. Together they form a unique fingerprint.

Cite this