An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree (1994)

Cached

Download Links

by Bernard M. E. Moret , Henry D. Shapiro
Citations:40 - 4 self

Active Bibliography

20 An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree – Bernard M. E. Moret, Henry D. Shapiro - 1991
4 How to Find a Minimum Spanning Tree in Practice – Bernard M. E. Moret, Henry D. Shapiro - 1991
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
Optimal Matching and Deterministic Sampling – Jeff Abrahamson - 2007
A New Priority Queue for Simulation of Many Objects – Ricardo Baeza-yates, Mauricio Marín
83 Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees – Greg N. Frederickson - 1991
1 Pairing Heaps are Sub-optimal – Michael L. Fredman - 1997
18 Checking Mergeable Priority Queues – Jonathan Bright, Gregory Sullivan - 1994
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
2 Violation heaps: A better substitute for Fibonacci heaps – Amr Elmasry - 812
Pairing Heaps with Costless Meld – Amr Elmasry - 903
3 A Practical Shortest Path Algorithm with Linear Expected Time – Andrew V. Goldberg - 2001
Finding Minimum Spanning Trees in O(m α(m,n)) Time – Seth Pettie - 1999