Author:
Du Ding-Zhu,Pardalos Panos,Hu Xiaodong,Wu Weili
Publisher
Springer International Publishing
Reference18 articles.
1. Otakar Boruvka on Minimum Spanning Tree Problem (translation of both 1926 papers, comments, history) (2000) Jaroslav Nesetril, Eva Milková, Helena Nesetrilová. (Section 7 gives his algorithm, which looks like a cross between Prim’s and Kruskal’s.)
2. Thomas S. Brylawski: A decomposition for combinatorial geometries, Transactions of the American Mathematical Society, 171: 235–282 (1972).
3. Bernard Chazelle: A minimum spanning tree algorithm with inverse-Ackermann type complexity, Journal of the Association for Computing Machinery, 47 (6): 1028–1047 (2000).
4. Bernard Chazelle: The soft heap: an approximate priority queue with optimal error rate, Journal of the Association for Computing Machinery, 47 (6): 1012–1027 (2000).
5. Henry H. Crapo, Gian-Cario Rota: On the Foundations of Combinatorial Theory: Combinatorial Geometries, (Cambridge, Mass.: M.I.T. Press, 1970).