An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree (1991)

Cached

Download Links

by Bernard M. E. Moret , Henry D. Shapiro
Venue:DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Citations:21 - 1 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
579 Fibonacci heaps and their uses in improved network optimization problems – M Fredman, R E Tarjan - 1987
549 Shortest connection networks and some generalizations – R C Prim - 1957
451 On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem – J B Kruskal - 1956
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
7552 Genetic Algorithms – D E Goldberg - 1989
1442 Network flows: Theory, algorithms and applications – R K Ahuja, T L Magnanti, J B Orlin - 1993
609 Data structures and network algorithms – R Tarjan - 1983
1499 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959