|
27
|
Sensitivity analysis of minimum spanning trees and shortest path problems
– R E Tarjan
- 1982
|
|
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
|
|
48
|
Verification and Sensitivity Analysis Of Minimum Spanning Trees In Linear Time
– Brandon Dixon, Monika Rauch, Robert, Robert E. Tarjan
- 1992
|
|
43
|
Undirected Single Source Shortest Paths in Linear Time
– Mikkel Thorup
- 1997
|
|
78
|
Vickrey Prices and Shortest Paths: What is an edge worth?
– John Hershberger, Subhash Suri
- 2001
|
|
26
|
The k most vital arcs in the shortest path problem
– K Malik, A K Mittal, S K Gupta
- 1989
|
|
23
|
On the Difficulty of Some Shortest Path Problems
– John Hershberger, Subhash Suri, Amit Bhosle
- 2003
|
|
78
|
Applications of path compression on balanced trees
– R E Tarjan
- 1979
|
|
37
|
An optimal minimum spanning tree algorithm
– Seth Pettie, Vijaya Ramachandran
- 2000
|
|
31
|
Balancing Minimum Spanning Trees and Shortest-Path Trees
– Samir Khuller, Balaji Raghavachari, Penn State, Neal Young
- 1995
|
|
4
|
Computing external farthest neighbors for a simple polygon
– P K Agarwal, A Aggarwal, B Aronov, S R Kosaraju, B Schieber, S Suri
- 1991
|
|
8
|
Optimal pagination of B-trees with variablelength items
– G Diehr, B Faaland
- 1984
|
|
25
|
River routing every which way, but loose
– R Cole, A Siegel
- 1982
|
|
126
|
Randomized Search Trees
– Raimund Seidel, Cecilia R. Aragon
- 1996
|
|
16
|
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
– David Eppstein
- 1994
|
|
59
|
A minimum spanning tree algorithm with inverse-ackermann type complexity
– Bernard Chazelle
|
|
16
|
Integer Priority Queues with Decrease Key in . . .
– Mikkel Thorup
- 2003
|
|
4
|
Efficient Algorithms for Single Link Failure Recovery and Its Application To Atm Networks
– Amit M Bhosle, Teofilo F Gonzalez
- 2003
|
