EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS

[1] Bock, 1971, DEV OPERATIONS RES, P29

[2] Boruvka O., 1926, PRACE MORAVSKE PRIRO, V3, P37

[3] NOTE ON FINDING OPTIMUM BRANCHINGS [J]. NETWORKS, 1979, 9 (04) : 309 - 312

[4] Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[5] CHU YJ, 1965, SCI SINICA, V14, P1396

[6] OPTIMUM BRANCHINGS [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 233 - +

[7] Fredman M. L., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P338, DOI 10.1109/SFCS.1984.715934

[8] FREDMAN ML, IN PRESS J ASS COMPU

[9] Gabow H. N., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P347, DOI 10.1109/SFCS.1984.715935

[10] EFFICIENT ALGORITHMS FOR A FAMILY OF MATROID INTERSECTION PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1984, 5 (01) : 80 - 131

[1] Bock, 1971, DEV OPERATIONS RES, P29

[2] Boruvka O., 1926, PRACE MORAVSKE PRIRO, V3, P37

[3] NOTE ON FINDING OPTIMUM BRANCHINGS [J]. NETWORKS, 1979, 9 (04) : 309 - 312

[4] Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[5] CHU YJ, 1965, SCI SINICA, V14, P1396

[6] OPTIMUM BRANCHINGS [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 233 - +

[7] Fredman M. L., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P338, DOI 10.1109/SFCS.1984.715934

[8] FREDMAN ML, IN PRESS J ASS COMPU

[9] Gabow H. N., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P347, DOI 10.1109/SFCS.1984.715935

[10] EFFICIENT ALGORITHMS FOR A FAMILY OF MATROID INTERSECTION PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1984, 5 (01) : 80 - 131