Active Bibliography

1 A Few Remarks On The History Of MST-Problem – Jaroslav Nesetril - 1997
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
14 A linear-work parallel algorithm for finding . . . – Richard Cole, Philip N. Klein, Robert E. Tarjan - 1994
19 Distributed Verification of Minimum Spanning Trees – Amos Korman, Shay Kutten - 2006
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
19 Finding minimum spanning forests in logarithmic time aud linear work using . . . – Richard Cole, Philip N. Klein, Robert E. Tarjan - 1996
7 State-of-the-Art Algorithms for Minimum Spanning Trees -- A Tutorial Discussion – Jason Eisner - 1997
5 Design and Analysis of Data Structures for Dynamic Trees – Renato F. Werneck - 2006
7 Representing all Minimum Spanning Trees with Applications to Counting and Generation – David Eppstein - 1995
54 Verification and Sensitivity Analysis Of Minimum Spanning Trees In Linear Time – Brandon Dixon, Monika Rauch, Robert, Robert E. Tarjan - 1992
8 Random Sampling and Greedy Sparsification for Matroid Optimization Problems. – David R. Karger - 1998
17 Graph Augmentation And Related Problems: Theory And Practice – Tsan-Sheng Hsu - 1993
3 An Inverse-Ackermann Style Lower Bound for Online Minimum Spanning Tree Verification – Seth Pettie
2 Testing Euclidean minimum spanning trees in the plane – Artur Czumaj, Christian Sohler, Martin Ziegler - 2007
6 Reconstructing a Minimum Spanning Tree after Deletion of Any Node – Bevan Das, Michael C. Loui - 1999
37 A Simpler Minimum Spanning Tree Verification Algorithm – Valerie King - 1995
12 Hierarchical Image Partitioning with Dual Graph Contraction – Yll Haxhimusa, Walter Kropatsch - 2003
12 An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM – Shay Halperin, Uri Zwick - 1996