A Distributed Algorithm for Minimum Weight Directed Spanning Trees

IEEE Transactions on Communications

Volumn 31, Issue 6, 1983, Pages 756-762

  Humblet, Pierre A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0020767252     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1983.1095883     Document Type: Article

References (12)

1. F. Bock, “An algorithm to construct a minimum directed spanning tree in a directed network,” in Developments in Operations Research. New York: Gordon and Breach, 1971, pp. 29-44.
2. P. M. Camerini, L. Fratta, and F. Maffioli, “A note on finding optimum branchings,” Networks, vol. 9. pp. 309-312, 1979.
3. Y. J. Chu and T. H. Liu, “On the shortest arborescence of a directed graph,” Sci. Sinica, vol. 14, pp. 1396-1400, 1965.
4. Y. K. Dalal and R. M. Metcalfe, “Reverse path forwarding of broadcast packets,” Commun. Ass. Comput. Mach., vol. 21, pp. 1040-1048, Dec. 1978.
5. Y. K. Dalal, “Broadcast protocols in packet switched computer networks,” Ph.D. dissertation. Digital Syst. Lab., Stanford Univ., Stanford, CA, Tech. Rep. 128, Apr. 1977.
6. J. Edmonds, “Optimum branchings,” J. Res. Nat. Bur. Stand., vol. 71b, pp. 233-240, 1967.
7. R. G. Gallager, personal communication.
8. R. G. Gallager, P. A. Humblet, and P. M. Spira, “A distributed algorithm for minimum weight spanning trees,” ACM Trans. Program. Lang. Syst., vol. 5, pp. 66-77, Jan. 1983.
9. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
10. V. Li, “Performance models of distributed database systems,” Lab. Inform. Decision Syst., Tech. Rep. TH-1066, M.I.T., Cambridge, MA, Feb. 1981.
11. P. M. Spira, “Communication complexity of distributed minimum spanning tree algorithms,” in Proc. 2nd Berkeley Conf. Distributed Data Manag. Comput. Networks. June 1977.
12. R. E. Tarjan, “Finding optimum branchings,” Networks, vol. 7, pp. 25-35, 1977.