[1] Jark A, Orlinjb M. Network Flows: Theory, Algorithms, and Applications[M]. 北京: 电子工业出版社, 2005. [2] Kruskal J. On the Shortest Spanning Subtree of a Graph and the Traveling Sales Man Problem[J]. Proceedings of the AMS, 1956, 7(1): 48-50. [3] Prim R C. Shortest Connection Networks and Some Genera- tions[J]. Bell System Technical Journal, 1957, 36(6): 1389-1401. [4] Sollin M, Le Trace de Canalisation. Programming, Games, and Transportation Networks[M]. New York, USA: John Wiley & Sons, Inc., 1965. [5] Dijkstra E W. A Note on Two Problems in Connexion with Graphs[J]. Numerische Mathematik, 1959, (1): 269-271. [6] 孙凌宇, 冷 明, 谭云兰, 等. 赋权有向图的最小生成树算 法[J]. 计算机工程, 2010, 36(2): 61-63. [7] Richard L J. DNA Solution of Hard Computation Problems[J]. Science, 1995, 268(28): 542- 545. [8] Liu Xikui, Li Yan, Xu Jin. Solving Minimum Spanning Tree Problem with DNA Computing[J]. Journal of Electronics, 2005, 22(2): 112-117. [9] Raidl G R, Julstrom B A. Edge Sets: An Effective Evolutionary Coding of Spanning Trees[J]. IEEE Trans. on Evolutionary Computation, 2003, 7(3): 225- 239. [10] Neumann F, Wegener I. Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem[J]. Theoretical Computer Science, 2007, 378(1): 32- 40. [11] Neumann F, Witt C. Ant Colony Optimization and the Minimum Spanning Tree Problem: Learning and Intelligent Optimiza- tion[C]//Proc. of the 2nd International Conference. Berlin, Germany: Springer-Verlag, 2007. [12] 吕 欣, 李 勇, 邓宏钟, 等. 基于节点合并的最短路问题新算法[J]. 小型微型计算机系统, 2009, 30(4): 695-699. [13] 谢 政. 网络算法与复杂性理论[M]. 长沙: 国防科学技术大学出版社, 2003.
|