Abstract
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(α(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 β), for any constant 0<Β<1. The above two algorithms are based on an algorithm of independent interest: computing a shortest path tree, or finding a negative cycle in linear time.
This work was partially supported by the EU ESPRIT Basic Research Action No. 7141 (ALCOM II).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Ahuja, T. Magnanti and J. Orlin, “Network Flows”, Prentice-Hall, 1993.
N. Alon and B. Schieber, “Optimal Preprocessing for Answering On-line Product Queries”, Tech. Rep. No. 71/87, Tel-Aviv University, 1987.
S. Arnborg, “Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability — A Survey”, BIT, 25, pp.2–23, 1985.
H. Bodlaender, “A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth”, Proc. 25th ACM STOC, pp.226–234, 1993.
H. Bodlaender, “A Tourist Guide through Treewidth”, Acta Cybernetica, Vol.11, No.1–2, pp.1–21, 1993.
H. Bodlaender, “Dynamic Algorithms for Graphs with Treewidth 2”, Proc. 19th WG'93, LNCS 790, pp.112–124, Springer-Verlag, 1994.
B. Chazelle, “Computing on a Free Tree via Complexity-Preserving Mappings”, Algorithmica, 2, pp.337–361, 1987.
H. Djidjev, G. Pantziou and C. Zaroliagis, “On-line and Dynamic Algorithms for Shortest Path Problems”, Proc. 12th STACS, 1995, LNCS 900, pp.193–204, Springer-Verlag.
E. Feuerstein and A.M. Spaccamela, “Dynamic Algorithms for Shortest Paths in Planar Graphs”, Theor. Computer Science, 116 (1993), pp.359–371.
G.N. Frederickson, “Fast algorithms for shortest paths in planar graphs, with applications”, SIAM J. on Computing, 16 (1987), pp.1004–1022.
G.N. Frederickson, “Planar Graph Decomposition and All Pairs Shortest Paths”, J. ACM, 38(1991), pp.162–204.
G.N. Frederickson, “Searching among Intervals and Compact Routing Tables”, Proc. 20th ICALP, 1993, LNCS 700, pp.28–39, Springer-Verlag.
G.N. Frederickson, “Using Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems”, accepted in J. of Algorithms, 1994.
M. Fredman and R. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms”, J. ACM, 34(1987), pp. 596–615.
D. Kavvadias, G. Pantziou, P. Spirakis and C. Zaroliagis, “Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem”, Proc. 5th ISAAC, 1994, LNCS 834, pp.270–278, Springer-Verlag.
P. Klein, S. Rao, M. Rauch and S. Subramanian, “Faster shortest-path algorithms for planar graphs”, Proc. 26th ACM STOC, 1994, pp.27–37.
N. Robertson and P. Seymour, “Graph Minors II: Algorithmic Aspects of Treewidth”, J. Algorithms, 7(1986), pp.309–322.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhuri, S., Zaroliagis, C.D. (1995). Shortest path queries in digraphs of small treewidth. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_78
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive