|
1
|
On sorting, heaps, and minimum spanning trees
– Gonzalo Navarro, Rodrigo Paredes
|
|
|
STRONGER QUICKHEAPS
– Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders
|
|
|
Finding Minimum Spanning Trees in O(m α(m,n)) Time
– Seth Pettie
- 1999
|
|
1
|
Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits
– Seth Pettie
|
|
3
|
State-of-the-Art Algorithms for Minimum Spanning Trees - A Tutorial Discussion
– Jason Eisner
- 1997
|
|
1
|
Priority Queues and Dijkstra’s Algorithm ∗
– Mo Chen, Rezaul Alam, Chowdhury Vijaya Ramach, David Lan, Roche Lingling Tong
- 2007
|
|
11
|
Experimental Evaluation of a New Shortest Path Algorithm
– Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
- 2001
|
|
9
|
A shortest path algorithm for real-weighted undirected graphs
– Seth Pettie, Vijaya Ramachandran
- 1985
|
|
2
|
Checking and Certifying Computational Results
– Jonathan D. Bright
- 1994
|
|
2
|
A Generalization of Binomial Queues
– Rolf Fagerberg
- 1996
|
|
7
|
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
– Irit Katriel, Peter Sanders, Jesper Larsson Träff, Jesper Larsson Tra
- 2003
|
|
1
|
Improved Algorithms for Replacement Paths Problems in Restricted Graphs
– Amit M Bhosle
- 2005
|
|
14
|
Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm
– Ka Wong Chong, Yijie Han, Tak-Wah Lam
- 2001
|
|
2
|
A Practical Shortest Path Algorithm with Linear Expected Time
– Andrew V. Goldberg
- 2001
|
|
|
Quickheaps: Simple, Efficient, and Cache-Oblivious ⋆
– Gonzalo Navarro, Rodrigo Paredes
|
|
37
|
An optimal minimum spanning tree algorithm
– Seth Pettie, Vijaya Ramachandran
- 2000
|
|
|
Computing Undirected Shortest Paths with Comparisons and Additions
– Seth Pettie, Vijaya Ramachandran
- 2001
|
|
5
|
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
– Seth Pettie
- 2002
|
|
1
|
A Few Remarks On The History Of MST-Problem
– Jaroslav Nesetril
- 1997
|
