Active Bibliography

Finding Minimum Spanning Trees in O(m α(m,n)) Time – - 1999
2 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – - 1998
12 A shortest path algorithm for real-weighted undirected graphs – - 1985
12 A randomized time-work optimal parallel algorithm for finding a minimum spanning forest – - 1999
4 Efficient Algorithms for Single Link Failure Recovery and Its Application To Atm Networks – - 2003
Computing Undirected Shortest Paths with Comparisons and Additions – - 2001
2 Checking and Certifying Computational Results – - 1994
1 A Few Remarks On The History Of MST-Problem – - 1997
7 State-of-the-Art Algorithms for Minimum Spanning Trees -- A Tutorial Discussion – - 1997
1 Improved Algorithms for Replacement Paths Problems in Restricted Graphs – - 2005
3 Efficient Algorithms for Path Problems in Weighted Graphs – - 2008
14 Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees – - 1993
2 Melding Priority Queues – - 2004
16 Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm – - 2001
3 An Inverse-Ackermann Style Lower Bound for Online Minimum Spanning Tree Verification
1.1 History and Content........................... 6 – - 2010
CLUSTERING
7 Representing all Minimum Spanning Trees with Applications to Counting and Generation – - 1995