Académique Documents
Professionnel Documents
Culture Documents
Vase tambin
Algoritmo de Prim Algoritmo de Kruskal Algoritmo de Dijkstra
Referencias
Otakar Boruvka on Minimum Spanning Tree Problem (translation of the both 1926 papers, comments, history) (2000) Jaroslav Nesetril, Eva Milkov, Helena Nesetrilov [1] (section 7 gives his algorithm, which looks like a cross between Prim's and Kruskal's) A Minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity [2], Bernard Chazelle, 1999 [3]
rbol recubridor mnimo Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Chapter 23: Minimum Spanning Trees, pp.561579. Two Algorithms for Generating Weighted Spanning Trees in Order [4], Harold Gabow, 1977 State-of-the-Art Algorithms for Minimum Spanning Trees: A Tutorial Discussion [5], Jason Eisner, 1997
Enlaces externos
Implementado en BGL, la "Boost Graph Library" [6]
Referencias
[1] [2] [3] [4] [5] [6] http:/ / citeseer. ist. psu. edu/ nesetril00otakar. html http:/ / www. cs. princeton. edu/ ~chazelle/ pubs. html http:/ / www. mts. jhu. edu/ ~fill/ papers/ mst. pdf http:/ / p. oisono. us/ misc/ gabow77. pdf http:/ / www. cs. jhu. edu/ ~jason/ papers/ index. html#ms97 http:/ / www. boost. org/ libs/ graph/ doc/ table_of_contents. html
Licencia
Creative Commons Attribution-Share Alike 3.0 Unported http:/ / creativecommons. org/ licenses/ by-sa/ 3. 0/