Shortest path queries in planar graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 469-478

  Chen, Danny Z ^a   Xu, Jinhui ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACKERMANN'S FUNCTIONS; ALGORITHMIC SOLUTIONS; INTEGER PARAMETERS; INTELLIGENT TRANSPORTATION SYSTEMS; PLANAR EMBEDDING; QUERY ALGORITHMS; SHORTEST PATH PROBLEM; SHORTEST PATH QUERIES;

ALGORITHMS; COMPUTATION THEORY; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; GRAPHIC METHODS; INTELLIGENT SYSTEMS; FUNCTIONS;

GRAPH THEORY;

PLANAR GRAPHS; SHORTEST PATH QUERIES;

EID: 0033722341     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335359     Document Type: Conference Paper

References (29)

1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, "Geometric Applications of a Matrix Searching Algorithm," Algorithmica, Vol. 2, 1987, pp. 195-208. (Pubitemid 17623592)
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
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 4th Annual European Symposium on Algorithm, Barcelona, Spain, 1996, pp. 514-528.
4. C. Aydin and D. Ierardi, "Partitioning Algorithms for Transportation Graphs and Their Applications to Routing, " Proc. of 9th Canadian Conference on Computational Geometry, 1997, pp. 245-250.
5. D.Z. Chen, K.S. Klenk, and H.-Y.T. Tu, "Shortest Path Queries among Weighted Obstacles in the Rectilinear Plane ," Proc. 11th Annual ACM Symp. on Computational Geometry, 1995, pp. 370-379. To appear in SIAM Journal on Computing.
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. (Pubitemid 128366608)
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.
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, 1990.
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 Symp. on Theor. Aspects of Comp. Sci., 1995, pp. 193-204.
10. E.W. Dijkstra, " A Note on Two Problems in Connexion with Graphs," Numer. Math., Vol. 1, 1959, pp. 269-271.
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.
12. G.N. Frederickson, " Fast Algorithms for Shortest Paths in Planar Graphs, with Applications," SIAM Journal on Computing, Vol. 16, No. 6, 1987, pp. 1004-1022.
13. G.N. Frederickson, " Planar Graph Decomposition and All Pairs Shortest Paths," Journal of ACM, Vol. 38, No. 1, 1991, pp. 162-204.
14. G.N. Frederickson, " Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems," Journal of Algorithms, Vol. 19, 1995, pp. 45-85.
15. G.N. Frederickson, "Searching Intervals and Compact Routing Table," Algorithmica, Vol. 15, 1996, pp. 448-466. (Pubitemid 126416928)
16. G.N. Frederickson and R. Janardan, "Designing Networks with Compact Routing Tables," Algorithmica, Vol. 3, 1988, pp. 171-190. (Pubitemid 18550592)
17. G.N. Frederickson and R. Janardan, "Space-Efficient Message Routing in c-Decomposable Networks," SIAM J. Comput., Vol. 19, No. 1, 1990, pp. 164-181. (Pubitemid 20673891)
18. M.L. Fredman and R.E. Tarjan, " Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms," Journal of ACM, Vol. 34, No. 3, 1987, pp. 596-615.
19. J. Hershberger and S. Suri, "Matrix Searching with the Shortest Path Metric ," Proc. 25th ACM Symp. on Theory of Comp., 1993, pp. 485-494.
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.
21. Y.W. Huang, N. Jing, and E.A. Rundensteiner, "A Semi-Materialized View Approach for Route Maintenance in IVHS ," Proc. of 2nd ACM Workshop on Geographic Information Systems, 1994, pp. 144-151.
22. Y.W. Huang, N. Jing, and E.A. Rundensteiner, "Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types ," Proc. 3rd ACM Workshop on Geographic Information Systems, 1995, pp. 93-100.
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.
24. P. Klein, S. Rao, M. Rauch, and S. Subramanian, "Faster Shortest-Path Algorithms for Planar Graphs ," Proc. 26th ACM Symp. on Theory of Comp., 1994, pp. 27-37.
25. D.C. Kozen, The Design and Analysis of Algorithms, Springer-Verlag, 1991.
26. E. Kranakis, D. Krizanc, and J. Urrutia, "Compact Routing and Shortest Path Information ," Proc. 2nd Annual International Colloquium on Structure Information and Communication Complexity, 1995, L.M. Kirousis, and E. Kranakis (eds.), Carleton University Press, Vol. 2, 1996, pp. 101-112.
27. R.J. Lipton and R.E. Tarjan, " A Separator Theorem for Planar Graphs," SIAM J. Appl. Math., Vol. 36, 1979, pp. 177-189.
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.
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.