Article

Free access

Shortest path queries in planar graphs

Authors:

Danny Z. Chen,

Jinhui XuAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 469 - 478

https://doi.org/10.1145/335305.335359

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, "Geometric Applications of a Matrix Searching Algorithm," Algorithmiea, Vol. 2, 1987, pp. 195-208.

Digital Library

Google Scholar

[2]

A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

Digital Library

Google Scholar

[3]

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," Lecture Notes in Computer Science, Vol. 1136, Springer Verlag, Proc. of dth Annual European Symposium on Algorithm, Barcelona, Spain, 1996, pp. 514-528.

Digital Library

Google Scholar

[4]

C. Aydin and D. Ierardi, "Partitioning Algorithms for Transportation Graphs and Their Applications to Routing," Proe. of 9th Canadian Conference on Computational Geometry, 1997, pp.~245-250.

Google Scholar

[5]

D.Z. Chen, K.S. Klenk, and H.-Y.T. Tu, "Shortest Path Queries among Weighted Obstacles in the Rectilinear Plane," Proe. i lth Annual A CM Syrup. on Computational Geometry, 1995, pp. 370-379. To appear in SIAM Journal on Computing.

Digital Library

Google Scholar

[6]

D.Z. Chen, D.T. Lee, R. Sridhar, and C.N. Sekharan, "Solving the All-Pair Shortest Path Query Problem on Interval and Circular-Arc Graphs," Networks, Vol. 31, No. 4, 1998, pp. 249-257.

Crossref

Google Scholar

[7]

S. Chaudhuri and C.D. Zaroliagis, "Shortest Path Queries in Digraphs of Small Treewidth," Lecture Notes in Computer Science, Vol. 944, Springer- Verlag, Proc. 22nd ICALP, 1995, pp. 244-255.

Digital Library

Google Scholar

[8]

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, 1990.

Digital Library

Google Scholar

[9]

H. Djidjev, G. Pantziou, and C. Zaroliagis, "On- Line and Dynamic Algorithms for Shortest Path Problems," Lecture Notes in Computer Science, Vol. 900, Springer-Verlag, Proc. 12th Syrup. on Theor. Aspects of Comp. $ci., 1995, pp. 193-204.

Google Scholar

[10]

E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numer. Math., Vol. 1, 1959, pp. 269-271.

Digital Library

Google Scholar

[11]

G.N. Frederickson, "Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications,'' SIAM Journal on Computing, Vol. 14, No. 4, 1985, pp. 781-798.

Crossref

Google Scholar

[12]

G.N. Frederickson, "Fast Algorithms for Shortest Paths in Planar Graphs, with Applications," SIAM Journal on Computing, Voi. 16, No. 6, 1987, pp. 1004-1022.

Digital Library

Google Scholar

[13]

G.N. Frederickson, "Planar Graph Decomposition and All Pairs Shortest Paths," Journal of A CM, Vol. 38, No. 1, 1991, pp. 162-204.

Digital Library

Google Scholar

[14]

G.N. Frederickson, "Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems,'' Journal of Algorithms, Vol. 19, 1995, pp. 45- 85.

Digital Library

Google Scholar

[15]

G.N. Frederickson, "Searching Intervals and Compact Routing Table," Algorithmica, Vol. 15, 1996, pp. 448-466.

Digital Library

Google Scholar

[16]

G.N. Frederickson and R. janardan, "Designing Networks with Compact Routing Tables," Algorithmica, Vol. 3, 1988, pp. 171-190.

Digital Library

Google Scholar

[17]

G.N. Frederickson and R. Janaxdan, "Space- Efiqcient Message Routing in c-Decomposable Networks," SIAM J. Comput., Vol. 19, No. 1, 1990, pp. 164-t81.

Digital Library

Google Scholar

[18]

M.L. Fredman and R.E. Tarjan, "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms," Journal of A CAll, Vol. 34, No. 3, 1987, pp. 596-615.

Digital Library

Google Scholar

[19]

J. Hershberger and S. Suri, "Matrix Searching with the Shortest Path Metric," Proc. 25th A GM Syrup. on Theory of Comp., 1993, pp. 485-494.

Digital Library

Google Scholar

[20]

Y.W. Huang, Query Optimization for Navigation in Geographic Information Systems, Ph.D. dissertation, Dept. of Computer Science and Engineering, Univ. of Michigan, 1997.

Digital Library

Google Scholar

[21]

Y.W. Huang, N. Jing, and E.A. Rundensteiner, "A Semi-Materialized View Approach for Route Maintenance in IVHS," Proc. of 2nd A CM Workshop on Geographic Information Systems, 1994, pp. 144- 151.

Google Scholar

[22]

Y.W. Huang, N,. Jing, and E.A. Rundensteiner, "Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types," Proc. 3rd A CM Workshop on Geographic Information Systems, 1995, pp. 93-100.

Google Scholar

[23]

Y.W. Huang, N. jing, and E.A. Rundensteiner, "Effective Graph Clustering for Path Queries in Digital Map Databases," Proc. of 5th International Conference on Information and Knowledge Management, 1996, pp. 215-222.

Digital Library

Google Scholar

[24]

P. Klein, S. Rao, M. Rauch, and S. Subramanian, "Faster Shortest-Path Algorithms for Planar Graphs," Proc. 26th A CM Syrup. on Theory of Comp., 1994, pp. 27-37.

Digital Library

Google Scholar

[25]

D.C. Kozen, The Design and Analysis of Algorithms, Springer~Verlag, 1991.

Digital Library

Google Scholar

[26]

E. Kranakis, D. Krizanc, and J. Urrutia, "Compact Routing and Shortest Path Information," Proc. ~nd Annual International Colloquium on Structure Information and Communication Complexity, 1995, L.M. Kirousis, and E. Kranakis (eds.), Carteton University Press, Vol. 2, 1996, pp. 101-112.

Google Scholar

[27]

R.J. Lipton and R.E. Taxjan, "A Separator Theorem for Planar Graphs," SIAM J. Appl. Math., Vol. 36, 1979, pp. 177-189.

Digital Library

Google Scholar

[28]

B. Schieber and U. Vishkin, "On Finding Lowest Common Ancestors: Simplification and Parallelization," SIAM J. Computing, Vol. 17, No. 6, 1988, pp. 1253-1262.

Digital Library

Google Scholar

[29]

S. Shekhar, A. Kohli, and M. Coyle, "Path Computation Algorithms for Advanced Traveler Information Systems," Proc. 9th Int. Conf. on Data Engineering, 1993, pp. 31-39.

Digital Library

Google Scholar

Cited By

View all

Filtser A(2024)A Face Cover Perspective to ℓ1 Embeddings of Planar GraphsACM Transactions on Algorithms10.1145/368680021:1(1-21)Online publication date: 5-Aug-2024
https://dl.acm.org/doi/10.1145/3686800
Charalampopoulos PGawrychowski PLong YMozes SPettie SWeimann OWulff-Nilsen C(2023)Almost Optimal Exact Distance Oracles for Planar GraphsJournal of the ACM10.1145/358047470:2(1-50)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3580474
Yu SShun J(2023)Parallel Filtered Graphs for Hierarchical Clustering2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00153(1967-1980)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00153
Show More Cited By

Index Terms

Shortest path queries in planar graphs

Recommendations

On shortest disjoint paths in planar graphs

For a graph G and a collection of vertex pairs {(s"1,t"1),...,(s"k,t"k)}, the k disjoint paths problem is to find k vertex-disjoint paths P"1,...,P"k, where P"i is a path from s"i to t"i for each i=1,...,k. In the corresponding optimization problem, the ...
Faster Shortest-Path Algorithms for Planar Graphs
Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case ...
Shortest Beer Path Queries in Outerplanar Graphs
Abstract
A beer graph is an undirected graph G, in which each edge has a positive weight and some vertices have a beer store. A beer path between two vertices u and v in G is any path in G between u and v that visits at least one beer store. We show that ...

Comments

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
1,027
Total Downloads

Downloads (Last 12 months)62
Downloads (Last 6 weeks)6

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Filtser A(2024)A Face Cover Perspective to ℓ1 Embeddings of Planar GraphsACM Transactions on Algorithms10.1145/368680021:1(1-21)Online publication date: 5-Aug-2024
https://dl.acm.org/doi/10.1145/3686800
Charalampopoulos PGawrychowski PLong YMozes SPettie SWeimann OWulff-Nilsen C(2023)Almost Optimal Exact Distance Oracles for Planar GraphsJournal of the ACM10.1145/358047470:2(1-50)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3580474
Yu SShun J(2023)Parallel Filtered Graphs for Hierarchical Clustering2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00153(1967-1980)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00153
Charalampopoulos PMozes STebeka B(2022)Exact Distance Oracles for Planar Graphs with Failing VerticesACM Transactions on Algorithms10.1145/351154118:2(1-23)Online publication date: 30-Mar-2022
https://dl.acm.org/doi/10.1145/3511541
Le HWulff-Nilsen C(2022)Optimal Approximate Distance Oracle for Planar Graphs2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS52979.2021.00044(363-374)Online publication date: Feb-2022
https://doi.org/10.1109/FOCS52979.2021.00044
Balzotti LFranciosa P(2022)Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear TimeComputer Science – Theory and Applications10.1007/978-3-031-09574-0_6(77-95)Online publication date: 24-Jun-2022
https://doi.org/10.1007/978-3-031-09574-0_6
Long YPettie SMarx D(2021)Planar distance oracles with better time-space tradeoffsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458213(2517-2536)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458213
Charalampopoulos PKarczmarz A(2021)Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar GraphsJournal of Computer and System Sciences10.1016/j.jcss.2021.09.008Online publication date: Sep-2021
https://doi.org/10.1016/j.jcss.2021.09.008
Charalampopoulos PMozes STebeka BChan T(2019)Exact distance oracles for planar graphs with failing verticesProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310562(2110-2123)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310562
Kisfaludi-Bak SNederlof Jvan Leeuwen EChan T(2019)Nearly ETH-tight algorithms for planar steiner tree with terminals on few facesProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310498(1015-1034)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310498
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On shortest disjoint paths in planar graphs

Faster Shortest-Path Algorithms for Planar Graphs

Shortest Beer Path Queries in Outerplanar Graphs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

On shortest disjoint paths in planar graphs

Faster Shortest-Path Algorithms for Planar Graphs

Shortest Beer Path Queries in Outerplanar Graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations