Finding Minimum Spanning Trees in O(m α(m,n)) Time (1999)

Cached

Download Links

by Seth Pettie
Citations:1 - 0 self

Active Bibliography

52 An optimal minimum spanning tree algorithm – Seth Pettie, Vijaya Ramachandran - 2000
1 Introduction Minimum Spanning Trees ∗ – Bang Ye, Wu Kun-mao Chao
701 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
29 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998
5 A Few Remarks On The History Of MST-Problem – Jaroslav Nesetril - 1997
798 Approximating discrete probability distributions with dependence trees – C. K. Chow, C. N. Liu - 1968
504 Computational Geometry – Michael Ian Shamos - 1978
890 Introduction to Algorithms, second edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
699 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999