摘要:
uni-konstanz.de
aip.org
sci-hub.se 参考文章(6)
Joseph B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society. ,vol. 7, pp. 48- 50 ,(1956) , 10.1090/S0002-9939-1956-0078686-7
R. E. Gomory, T. C. Hu, An Application of Generalized Linear Programming to Network Flows Journal of The Society for Industrial and Applied Mathematics. ,vol. 10, pp. 260- 283 ,(1962) , 10.1137/0110020
L. R. Ford, D. R. Fulkerson, Maximal Flow Through a Network Canadian Journal of Mathematics. ,vol. 8, pp. 243- 248 ,(1956) , 10.1007/978-0-8176-4842-8_15
R. C. Prim, Shortest Connection Networks And Some Generalizations Bell System Technical Journal. ,vol. 36, pp. 1389- 1401 ,(1957) , 10.1002/J.1538-7305.1957.TB01515.X
R. T. Chien, Synthesis of a communication net Ibm Journal of Research and Development. ,vol. 4, pp. 311- 320 ,(1960) , 10.1147/RD.43.0311
W. Mayeda, Terminal and Branch Capacity Matrices of a Communication Net IEEE Transactions on Circuits and Systems I-regular Papers. ,vol. 7, pp. 261- 269 ,(1960) , 10.1109/TCT.1960.1086673