|
20
|
An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree
– Bernard M. E. Moret, Henry D. Shapiro
- 1991
|
|
38
|
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree
– Bernard M. E. Moret, Henry D. Shapiro
- 1994
|
|
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
|
|
|
Rank-Pairing Heaps
– Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
|
|
2
|
A Practical Shortest Path Algorithm with Linear Expected Time
– Andrew V. Goldberg
- 2001
|
|
2
|
Thin Heaps, Thick Heaps
– Haim Kaplan, Robert E. Tarjan
- 2006
|
|
|
Optimal Matching and Deterministic Sampling
– Jeff Abrahamson
- 2007
|
|
2
|
A Generalization of Binomial Queues
– Rolf Fagerberg
- 1996
|
|
2
|
Checking and Certifying Computational Results
– Jonathan D. Bright
- 1994
|
|
1
|
On sorting, heaps, and minimum spanning trees
– Gonzalo Navarro, Rodrigo Paredes
|
|
8
|
A framework for speeding up priorityqueue operations
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2004
|
|
19
|
Shortest Path Algorithms: Engineering Aspects
– Andrew Goldberg
- 2001
|
|
16
|
Integer Priority Queues with Decrease Key in . . .
– Mikkel Thorup
- 2003
|
|
97
|
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
– G. Ramalingam, Thomas Reps
- 1992
|
|
43
|
Exact and Approximate Distances in Graphs - a survey
– Uri Zwick
- 2001
|
|
7
|
Parallel Shortest Path Algorithms for Solving . . .
– Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak
- 2006
|
|
|
Finding Minimum Spanning Trees in O(m α(m,n)) Time
– Seth Pettie
- 1999
|
