Abstract
This paper describes algorithms for answering shortest path queries in digraphs with small separators and, in particular, in planar digraphs. In this version of the problem, one has to preprocess the input graph so that, given an arbitrary pair of query vertices v and w, the shortest-path distance between v and w can be computed in a short time. The goal is to achieve balance between the preprocessing time and space and the time for answering a distance query. Previously, efficient algorithms for that problem were known only for the class of outerplanar digraphs and for the class of digraphs of constant treewidth. We describe efficient algorithms for this problem for any class of digraphs for which an O(√n) separator theorem holds. For such graphs our algorithm uses O(S) space and answers queries in O(n 2/S) time, for any previously chosen S ∃ [n, n 2]. For the class of planar digraphs improved algorithms are described.
This work was partially supported by the NSF grant No. CCR-9409191.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, 1993.
S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, and C.D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proceedings of ESA '96, to appear.
H. Bodlaender. Dynamic algorithms for graphs with treewidth 2. In WG'93, Lecture Notes in Computer Science, vol. 790, pages 112–124. Springer-Verlag, Berlin, Heidelberg, New York, Tokio, 1994.
Shiva Chaudhuri and Christos D. Zaroliagis. Shortest path queries in digraphs of small treewidth. In ICALP'95, Lecture Notes in Computer Science, vol. 944, pages 244–255. Springer-Verlag, Berlin, Heidelberg, New York, Tokio, 1995.
E.W. Dijkstra. A note on two problems in connection with graphs. Numer. Math, 1:269–271, 1959.
H. Djidjev, G. Pantziou, and C. Zaroliagis. Computing shortest paths and distances in planar graphs. Proc. of 18th International Colloquium on Automata Languages and Programming, pages 327–339, 1991.
E. Feuerstein and A.M. Spaccamela. Dynamic algorithms for shortest paths in planar graphs. In WG'91, Lecture Notes in Computer Science, vol 570, pages 187–197. Springer-Verlag, Berlin, Heidelberg, New York, Tokio, 1991.
G. N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171–190, 1988.
G.N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing, 16:1004–1022, 1987.
Michael L. Fredman and Robert E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596–615, 1987.
Michael T. Goodrich. Planar separators and parallel polygon triangulation. Proceedings of 24th Symp. on Theory of Computing, pages 507–516, 1992.
Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24:1–13, 1977.
P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In 26th ACM Symp. Theory of Computing, pages 27–37, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Djidjev, H.N. (1997). Efficient algorithms for shortest path queries in planar digraphs. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-62559-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62559-9
Online ISBN: 978-3-540-68072-7
eBook Packages: Springer Book Archive