4Salama H F, Reeves D S, Viniotis Y. The delay-constrained minimum spanning tree problem[C]//Computers and Communications, 1997. Proceedings., Second IEEE Symposium on. IEEE, 1997: 699-703.
5Kruskal J B. On the shortest spanning subtree of a graph and the traveling salesman problem[J]. Proceedings of the American Mathe- matical society, 1956, 7(1): 48-50.
6Prim R C. Shortest connection networks and some generalizations[J]. Bell system technical journal, 1957, 36(6): 1389-1401.
7管梅谷.求最小树的破圈法[J].数学的实践与认识,1975,5(4):38-41.
8Dijkstra E W. A note on two problems in connexion with graphs[J]. Numerische mathematik, 1959,1(1):269-271.
9Edmonds J. Paths, trees, and flowers[J]. Canadian Journal of mathematics, 1965,17(3):449-467.
10Thomassen C. Spanning trees and orientations of graphs[J]. Journal of Combinatorics, 2010,1(2):101-111.
