A Distributed Algorithm for Minimum-Weight Spanning Trees

@article{Gallager1979ADA,
  title={A Distributed Algorithm for Minimum-Weight Spanning Trees},
  author={Robert G. Gallager and Pierre A. Humblet and Philip M. Spira},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1979},
  volume={5},
  pages={66-77}
}
A distributed algorithm is presented that constructs the minimum-weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange messages with neighbors until the tree is constructed. The total number of messages required for a graph of N nodes and E edges is at most 5N log2N + 2E, and a message contains at most one edge… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 606 CITATIONS, ESTIMATED 88% COVERAGE

A pragmatic testbed for distributed systems

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Throughput and Energy Efficiency in Wireless Ad Hoc Networks with Gaussian Channels

  • 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)
  • 2010
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Aspects of knowledge and belief-based programming

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

K-clustering in wireless ad hoc networks

VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Round- and Message-Optimal Distributed Graph Algorithms

VIEW 14 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The Distributed Minimum Spanning Tree Problem

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A distributed, compact routing protocol for the Internet

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1983
2019

CITATION STATISTICS

  • 63 Highly Influenced Citations

  • Averaged 18 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES