A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 5, Issue 1, 1983, Pages 66-77

  Gallager, R G ^a   Humblet, P A ^a   Spira, P M ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b APPLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976831429     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/357195.357200     Document Type: Article

References (9)

1. DALAL, Y. Broadcast protocols in packet switched computer networks. Tech. Rep. 128, Dep. of Electrical Engineering, Stanford Univ., Apr. 1977 (revised version for publication in preparation).
2. DIJKSTRA, E. Two problems in connection with graphs. Numer. Math. 1 (1959), 269-271.
3. HUMBLET, P.A. A distributed algorithm for minimum weight directed spanning trees. Rep. LIDS-P-1149, Laboratory for Information and Decision Systems, Massachusetts Inst. of Technology, Cambridge, Mass., Sept. 1981.
4. KRUSKAL, J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7 (1956), 48-50.
5. LAWLER, E. Combinatorial Optimization-Networks and Matroids. Holt, Rinehart & Winston, New York, 1976.
6. LIU, C.L. Introduction to Combinatorial Mathematics. McGraw Hill, New York, 1968.
7. PRIM, R.C. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 (1957), 1389-1401.
8. SPmA, P. Communication complexity of distributed minimum spanning tree algorithms. In Proceedings, 2nd Berkeley Conference on Distributed Data Management and Computer Networks, Berkeley, Calif., June 1977.
9. YAO, A.C.C. An O(E log log V) algorithm for finding minimum spanning trees. Inf. Process. Lett. 4 (1975), 21-23.