|
493
|
Fibonacci heaps and their uses in improved network optimization algorithms
– M L Fredman, R E Tarjan
- 1987
|
|
141
|
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
– M L Fredman, D E Willard
- 1990
|
|
47
|
The pairing heap: A new form of self-adjusting heap
– M L Fredman, R Sedgewick, D D Sleator, R E Tarjan
- 1986
|
|
321
|
On the shortest spanning subtree of a graph and the traveling salesman problem
– J Kruskal
- 1956
|
|
406
|
RC: Shortest connection networks and some generalizations
– Prim
|
|
37
|
An optimal minimum spanning tree algorithm
– Seth Pettie, Vijaya Ramachandran
- 2000
|
|
14
|
On the efficiency of pairing heaps and related data structures
– M L Fredman
- 1999
|
|
30
|
Pairing heaps: experiments and analysis
– J Stasko, J Vitter
- 1987
|
|
140
|
Algorithm 232: heapsort
– J Williams
- 1964
|
|
593
|
LEDA: A Platform for Combinatorial and Geometric Computing
– Kurt Mehlhorn, Stefan Näher, Christian Uhrig
- 1999
|
|
63
|
Finding minimum spanning trees
– D Cheriton, R Tarjan
- 1976
|
|
67
|
Tarjan, “Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation
– J R Driscoll, H N Gabow, R Shrairman, R E
- 1988
|
|
11
|
I/O-efficient construction of constrained Delaunay triangulations
– P K Agarwal, L Arge, K Yi
- 2005
|
|
10
|
Top-down analysis of path compression
– R Seidel, M Sharir
- 2005
|
|
14
|
Engineering an External Memory Minimum Spanning Tree Algorithm
– Roman Dementiev, Peter S, Dominik Schultes, Jop Sibeyn
- 2004
|
|
102
|
Leeuwen. Worst-case analysis of set union algorithms
– R E Tarjan, J Van
- 1984
|
|
39
|
Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds
– Herbert Edelsbrunner, John Harer, Afra Zomorodian
- 2001
|
|
119
|
The cell probe complexity of dynamic data structures
– Michael L Fredman, Michael E Saks
- 1989
|
|
159
|
External-Memory Graph Algorithms
– Yi-Jen Chiang , Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter
- 1995
|
