A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES

[1] DALAL Y, 1977, 128 STANF U DEP EL E

[2] Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[3] HUMBLET PA, 1981, LIDSP1149 MIT LAB IN

[4] Kruskal J.B., 1956, P AM MATH SOC, V7, P3, DOI [10.1090/S0002-9939-1956-0078686-7, DOI 10.1090/S0002-9939-1956-0078686-7, 10.2307/2033241]

[5] Lawler E.L., 1976, COMBINATORIAL OPTIMI

[6] Liu C. L., 1968, INTRO COMBINATORIAL

[7] SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1957, 36 (06): : 1389 - 1401

[8] SPIRA PM, 1977, 2ND P BERK C DISTR D

[9] Yao A. C., 1975, Information Processing Letters, V4, P21, DOI 10.1016/0020-0190(75)90056-3

[1] DALAL Y, 1977, 128 STANF U DEP EL E

[2] Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[3] HUMBLET PA, 1981, LIDSP1149 MIT LAB IN

[4] Kruskal J.B., 1956, P AM MATH SOC, V7, P3, DOI [10.1090/S0002-9939-1956-0078686-7, DOI 10.1090/S0002-9939-1956-0078686-7, 10.2307/2033241]

[5] Lawler E.L., 1976, COMBINATORIAL OPTIMI

[6] Liu C. L., 1968, INTRO COMBINATORIAL

[7] SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1957, 36 (06): : 1389 - 1401

[8] SPIRA PM, 1977, 2ND P BERK C DISTR D

[9] Yao A. C., 1975, Information Processing Letters, V4, P21, DOI 10.1016/0020-0190(75)90056-3