A linear-time optimal-message distributed algorithm for minimum spanning trees

Authors:
Michalis Faloutsos;Mart Molle
Affiliations:
University of California Riverside, Department of Computer Science, Riverside, CA;University of California Riverside, Department of Computer Science, Riverside, CA
Venue:
Distributed Computing
Year:
2004

Citing 8
Cited 3

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fast distributed construction of k-dominating sets and applications

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Optimal distributed algorithm for minimum spanning trees revisited

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Improvements in the time complexity of two message-optimal election algorithms

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms

Distributed Algorithms
What features really make distributed minimum spanning tree algorithms efficient?

ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
A highly asynchronous minimum spanning tree protocol

Distributed Computing

A minimum spanning tree algorithm for efficient P2P video streaming system

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
A distributed algorithm for min-max tree and max-min cut problems in communication networks

IEEE/ACM Transactions on Networking (TON)
Distributed computation of all node replacements of a minimum spanning tree

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an earlier paper, Awerbuch presented an innovative distributed algorithm for solving minimum spanning tree (MST) problems that achieved optimal time and message complexity through the introduction of several advanced features. In this paper, we show that there are some cases where his algorithm can create cycles or fail to achieve optimal time complexity. We then show how to modify the algorithm to avoid these problems, and demonstrate both the correctness and optimality of the revised algorithm.