Active Bibliography

Finding Minimum Spanning Trees in O(m α(m,n)) Time – Seth Pettie - 1999
1 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
12 A randomized time-work optimal parallel algorithm for finding a minimum spanning forest – Seth Pettie, Vijaya Ramachandran - 1999
4 Efficient Algorithms for Single Link Failure Recovery and Its Application To Atm Networks – Amit M Bhosle, Teofilo F Gonzalez - 2003
Computing Undirected Shortest Paths with Comparisons and Additions – Seth Pettie, Vijaya Ramachandran - 2001
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
1 A Few Remarks On The History Of MST-Problem – Jaroslav Nesetril - 1997
7 State-of-the-Art Algorithms for Minimum Spanning Trees -- A Tutorial Discussion – Jason Eisner - 1997
1 Improved Algorithms for Replacement Paths Problems in Restricted Graphs – Amit M Bhosle - 2005
2 Efficient Algorithms for Path Problems in Weighted Graphs – Virginia Vassilevska - 2008
14 Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees – David R. Karger - 1993
2 Melding Priority Queues – Ran Mendelson, Robert E. Tarjan, Mikkel Thorup, Uri Zwick - 2004
16 Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm – Ka Wong Chong, Yijie Han, Tak-Wah Lam - 2001
3 An Inverse-Ackermann Style Lower Bound for Online Minimum Spanning Tree Verification – Seth Pettie
1.1 History and Content........................... 6 – Jinna Lei - 2010
CLUSTERING – Sanguthevar Rajasekaran, Senior Member
7 Representing all Minimum Spanning Trees with Applications to Counting and Generation – David Eppstein - 1995