We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efficiently answered. We give algorithms that depend on the treewidth of the input graph. When the treewidth is a constant, our algorithms can answer distance queries in O(ff(n)) time after O(n) preprocessing. This improves upon previously known results for the same problem. We also give a dynamic algorithm which, after a change in an edge weight, updates the data structure in time O(n fi), for any constant 0! fi! 1. Furthermore, an algorithm of independent interest is given: computing a shortest path tree, or finding a negative cycle in linear time.
|
6058
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
2049
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
572
|
An Introduction to Parallel Algorithms
– JàJà
- 1992
|
|
421
|
Fibonacci heaps and their uses in improved network optimization problems
– Fredman, Tarjan
- 1987
|
|
288
|
Graph minors. II. Algorithmic aspects of tree-width
– Robertson, Seymour
- 1986
|
|
194
|
Easy Problems for Tree-Decomposable Graphs
– Arnborg, Lagergren, et al.
- 1991
|
|
193
|
Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposibility
– Arnborg
- 1985
|
|
176
|
A linear time algorithm for finding tree-decompositions of small treewidth
– Bodlaender
- 1996
|
|
154
|
A tourist guide through treewidth
– Bodlaender
- 1992
|
|
153
|
On finding lowest common ancestors: simplifications and parallelizations
– Schieber, Vishkin
|
|
98
|
Faster shortest-path algorithms for planar graphs
– Henzinger, Klein, et al.
- 1997
|
|
88
|
P.D.: Graph minors I: Excluding a forest
– Robertson, Seymour
- 1983
|
|
80
|
Fast algorithms for shortest paths in planar graphs, with applications
– Frederickson
- 1987
|
|
41
|
Zum Hilbertschen Aufbau der reellen Zahlen. Mathematische Annalen
– Ackermann
- 1928
|
|
36
|
Optimal preprocessing for answering on-line product queries
– Alon, Schieber
|
|
28
|
Efficient parallel shortest-paths in digraphs with a separator decomposition
– Cohen
- 1996
|
|
27
|
NC-algorithms for graphs with small treewidth
– Bodlaender
- 1988
|
|
26
|
Parallel algorithms with optimal speedup for bounded treewidth
– Bodlaender, Hagerup
- 1995
|
|
24
|
Planar graph decomposition and all pairs shortest paths
– Frederickson
- 1991
|
|
22
|
Searching among intervals in compact routing tables. Algorithmica
– Frederickson
- 1996
|
|
20
|
Computing on a free tree via complexity-preserving mappings
– CHAZELLE
- 1987
|
|
20
|
An Introduction to Parallel Algorithms, Addison-Wesley Pub CO
– Jájá
- 1992
|
|
19
|
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
– Han, Pan, et al.
- 1992
|
|
17
|
A linear-processor, polylog-time algorithm for shortest paths in planar graphs
– Klein, Subramanian
|
|
15
|
Shortest path queries in digraphs of small treewidth
– Chaudhuri, Zaroliagis
- 1995
|
|
14
|
A tourist guide through treewidth, Acta Cybernetica
– Bodlaender
- 1993
|
|
13
|
Using Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems
– Frederickson
- 1995
|
|
13
|
Dynamic algorithms for shortest paths in planar graphs
– Feuerstein, Marchetti-Spaccamela
- 1993
|
|
10
|
On-line and Dynamic Algorithms for Shortest Path Problems
– Djidjev, Pantziou, et al.
- 1995
|
|
9
|
Efficient sequential and parallel algorithms for the negative cycle problem
– Kavvadias, Pantziou, et al.
- 1994
|
|
9
|
Dynamic algorithms for graphs with treewidth 2
– Bodlaender
- 1993
|
|
3
|
Network Flows (Prentice-Hall
– Ahuja, Magnanti, et al.
- 1993
|
|
