|
|
© 1998 Springer-Verlag New York Inc. A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs 1
– P. N. Klein, S. Subramanian
|
|
|
Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs
– Sairam Subramanian, Sairam Subramanian, Philip N. Klein, Roberto Tamassia, Jeffrey S. Vitter
- 1995
|
|
12
|
I/O-Efficient Algorithms for Shortest Path Related Problems
– Norbert Ralf Zeh
- 2002
|
|
137
|
Faster Shortest-Path Algorithms for Planar Graphs
– Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian
- 1994
|
|
3
|
Fully Dynamic Planarity Testing with Applications
– Zvi Galil, et al.
|
|
14
|
Improved Algorithms for Dynamic Shortest Paths
– Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
- 1996
|
|
7
|
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
– Camil Demetrescu
- 2006
|
|
19
|
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
– Shiva Chaudhuri , Christos D. Zaroliagis
- 1995
|
|
28
|
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights
– Camil Demetrescu, Giuseppe F. Italiano
- 2001
|
|
4
|
A Uniform Approach to Semi-Dynamic Problems on Digraphs
– Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
- 1998
|
|
48
|
Dynamic Graph Algorithms
– David Eppstein, Zvi Galil, Giuseppe F. Italiano
- 1999
|
|
11
|
Dynamic Graph Algorithms
– Joan Feigenbaum, Sampath Kannan
- 2000
|
|
17
|
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
– Jesper L. Träff, Christos D. Zaroliagis
- 1996
|
|
2
|
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
– Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter
- 1993
|
|
15
|
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem
– Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone
- 1997
|
|
1
|
Placing Resources in a Tree: Dynamic and Static Algorithms
– Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
|
|
13
|
Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree
– Vincenzo Auletta , Domenico Parente, Giuseppe Persiano
- 1996
|
|
2
|
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs
– Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer, Brown U
|
|
1
|
External Data Structures for Shortest Path Queries on Planar Digraphs
– Lars Arge, Laura Toma
|
