|
4
|
An Efficient Algorithm for the Shortest Path Problem
– Diab Abuaiadh, Jeffrey H. Kingston
- 1993
|
|
24
|
On the Inverse Shortest Path Problem
– Didier Burton
- 1993
|
|
3
|
Efficient Shortest Path Algorithms By Graph Decomposition
– Diab Abuaiadh, Jeffrey H. Kingston
- 1994
|
|
2
|
A Practical Shortest Path Algorithm with Linear Expected Time
– Andrew V. Goldberg
- 2001
|
|
53
|
Scaling Algorithms for Network Problems
– Harold N. Gabow
- 1985
|
|
4
|
Buckets, Heaps, Lists, and Monotone Priority Queues
– Boris Cherkassky, Krasikova St, Andrew V. Goldberg
- 1997
|
|
|
Development and Testing of Dynamic Traffic Assignment . . .
– Hani S. Mahmassani, et al.
- 1994
|
|
26
|
Real-time Simulation of a Set Machine on a RAM
– Robert Paige, Robert Paige
- 1994
|
|
3
|
Heap-on-Top Priority Queues
– Boris V. Cherkassky, Krasikova St, Andrew V. Goldberg
- 1996
|
|
16
|
Integer Priority Queues with Decrease Key in . . .
– Mikkel Thorup
- 2003
|
|
2
|
Thin Heaps, Thick Heaps
– Haim Kaplan, Robert E. Tarjan
- 2006
|
|
|
Directed Single-Source Shortest-Paths in Linear Average-Case Time
– Ulrich Meyer, Ulrich Meyer
- 2001
|
|
|
Effiziente Algorithmen für ein Fahrplanauskunftsystem
– Frank Schulz
- 2000
|
|
24
|
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
– Ulrich Meyer
- 2001
|
|
45
|
Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects
– Stefano Pallottino, Maria Grazia Scutellà
- 1998
|
|
|
Rank-Pairing Heaps
– Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
|
|
7
|
Are Fibonacci Heaps Optimal?
– Diab Abuaiadh, Jeffrey H. Kingston
- 1994
|
|
|
Backtracking
– Alberto Apostolico, Giuseppe F. Italiano
|
|
58
|
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
– David R. Karger, Daphne Koller, Steven J. Phillips
- 1993
|
