A Practical Minimum Spanning Tree Algorithm Using the Cycle Property (2003)

Cached

Download Links

by Irit Katriel , Peter Sanders , Jesper Larsson Träff
Venue:IN 11TH EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA), NUMBER 2832 IN LNCS
Citations:10 - 2 self

Active Bibliography

3 An Inverse-Ackermann Style Lower Bound for Online Minimum Spanning Tree Verification – Seth Pettie
14 Engineering an External Memory Minimum Spanning Tree Algorithm – Roman Dementiev, Peter Sanders, Dominik Schultes, Jop Sibeyn - 2004
7 Minimizing Randomness in Minimum Spanning Tree, Parallel Connectivity, and Set Maxima Algorithms – Seth Pettie, Vijaya Ramachandran - 2001
1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
7 Optimal incremental sorting – Rodrigo Paredes, Gonzalo Navarro - 2006
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
On Cartesian Trees and Range Minimum Queries – Oren Weimann
76 Nearest Common Ancestors: A survey and a new distributed algorithm – Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe - 2002
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
14 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
139 A Course in Combinatorial Optimization – Alexander Schrijver - 2004
2 Traveling salesman games with the Monge property – Yoshio Okamoto - 2001
2 Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem – Bryant A. Julstrom - 2004
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
5 All-Pairs Min-Cut in Sparse Networks – Shiva Chaudhuri, Srinivasa R. Arikati, Srinivasa R. Arikati, Christos D. Zaroliagis, Christos D. Zaroliagis - 1996
All-Pairs Min-Cut in Sparse Networks? (FSTTCS'95) – Srinivasa R. Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
Finding Minimum Spanning Trees in O(m α(m,n)) Time – Seth Pettie - 1999
2 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
1 R.F.: Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights – Celso C. Ribeiro, Rodrigo F. Toso - 2007