A DISTRIBUTED ALGORITHM FOR MINIMUM WEIGHT DIRECTED SPANNING-TREES

被引：52

作者：

HUMBLET, PA ^{[1
]}

机构：

[1] MIT,INFORMAT & DECIS SYST LAB,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1109/TCOM.1983.1095883

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：756 / 762

页数：7

共 12 条

[1] Bock, 1971, DEV OPERATIONS RES, P29
[2] NOTE ON FINDING OPTIMUM BRANCHINGS
CAMERINI, PM
FRATTA, L
MAFFIOLI, F
[J]. NETWORKS, 1979, 9 (04) : 309 - 312
[3] CHU YJ, 1965, SCI SINICA, V14, P1396
[4] REVERSE PATH FORWARDING OF BROADCAST PACKETS
DALAL, YK
METCALFE, RM
[J]. COMMUNICATIONS OF THE ACM, 1978, 21 (12) : 1040 - 1048
[5] DALAL YK, 1977, 128 STANF U DIG SYST
[6] OPTIMUM BRANCHINGS
EDMONDS, J
[J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 233 - +
[7] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES
GALLAGER, RG
HUMBLET, PA
SPIRA, PM
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01): : 66 - 77
[8] GALLAGER RG, COMMUNICATION
[9] Lawler E.L., 1976, COMBINATORIAL OPTIMI
[10] LI V, 1981, TH1066 MIT LAB INF D