579

Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms
– M Fredman, R Tarjan
 1987

48

The pairing heap: A new form of selfadjusting heap
– M L Fredman, R Sedgewick, D D Sleator, R E Tarjan
 1986

439

On the shortest spanning subtree of a graph and the traveling salesman problem
– J B Kruskal
 1956

534

Shortest connection networks and some generalizations
– R Prim
 1957

162

Transdichotomous algorithms for minimum spanning trees and shortest paths
– M Fredman, D E Willard
 1990

46

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

150

Algorithm 232: Heapsort
– J W J Williams
 1964

31

Pairing heaps: Experiments and analysis
– J T Stasko, Jeffrey S Vitter
 1987

643

LEDA: A Platform for Combinatorial and Geometric Computing
– Kurt Mehlhorn, Stefan NĂ¤her, Christian Uhrig
 1999

67

Finding minimum spanning trees
– D Cheriton, R E Tarjan
 1976

73

Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation
– James R Driscoll, Harold N Gabow, Ruth Shrairman, Robert E Tarjan
 1988

10988

Computers and Intractability: A Guide to the Theory of NPcompleteness
– M Garey, D Johnson
 1979

7299

Genetic Algorithm
– D E Goldberg
 1989

1402

Network Flows: Theory, Algorithms, and Applications
– R K Ahuja, T L Magnanti, J B Orlin
 1993

86

A data structure for manipulating priority queues
– J Vuillemin
 1978

607

Data Structures and Network Algorithms
– R E Tarjan
 1983

104

Faster algorithms for the shortest path problem
– Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan
 1990

1427

A Note on Two Problems in Connexion with Graphs
– E. W. Dijkstra
 1959
