Oracles for bounded-length shortest paths in planar graphs

ACM Transactions on Algorithms

Volumn 2, Issue 3, 2006, Pages 335-363

  Kowalik, ŁUkasz ^a,b   Kurowski, Maciej ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Bounded length; Dynamic environment; Oracle; Planar graph; Shortest path

Indexed keywords

BOUNDED LENGTH; DYNAMIC ENVIRONMENT; ORACLE; PLANAR GRAPH; SHORTEST PATH;

ALGORITHMS; DATA STRUCTURES;

GRAPH THEORY;

EID: 33749009751     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1159892.1159895     Document Type: Article

References (24)

1. AHUJA, R. K., MAGNANTI, T. L., AND ORLIN, J. B. 1993. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliff, NJ.
2. AICHHOLZER, O., AURENHAMMER, F., AND ROTE, G. 1995. Optimal graph orientation with storage applications. SFB-Report F003-51, SFB 'Optimierung und Kontrolle', TU Graz, Austria.
3. ALON, N., YUSTER, R., AND ZWICK, U. 1997. Finding and counting given length cycles. Algorithmica 17, 3, 209-223.
4. ARIKATI, S. R., CHEN, D. Z., CHEW, L. P., DAS, G., SMID, M. H. M., AND ZAROLIAGIS, C. D. 1996. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proceedings of the European Symposium on Algorithms. 514-528.
5. BRODAL, G. S., AND FAGERBERG, R. 1999. Dynamic representations of sparse graphs. In Proceedings of the 6th International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 1663. Springer-Verlag, New York, 342-351.
6. CHEN, D. A., AND Xu, J. 2000. Shortest path queries in planar graphs. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York, 469-478.
7. CHIBA, N., AND NISHIZEKI, T. 1985. Arboricity and subgraph listing algorithms. SIAM J. Comput. 14, 1, 210-223.
8. CHROBAK, M., AND EPPSTEIN, D. 1991. Planar orientations with low out-degree and compaction of adjacency matrices. Theoret. Comput. Sci. 86, 2, 243-266.
9. DEMETRESCU, C., AND THORUP, M. 2002. Oracles for distances avoiding a link-failure. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphim, PA, 838-843.
10. DIESTEL, R. 2000. Graph Theory. Springer-Verlag, New York.
11. DJIDJEV, H. 1996. Efficient algorithms for shortest path queries in planar digraphs. In Proceedings of 22nd International Workshop Graph-Theoretic Concepts in Computer Science (WG 1996). 151-165.
12. DJIDJEV, H. 2000. Computing the girthof aplanar graph. In Proceedings of 27th International Colloquium on Automata, Languages and Programming. 821-831.
13. EPPSTEIN, D. 1999. Subgraph isomorphism in planar graphs and related problems. J. Graph Algor. Appl. 3, 3, 1-27.
14. FEDERICKSON, G. N. 1987. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16, 6 (Dec.), 1004-1022.
15. FREDERICKSON, G. N. 1997. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM J. Comput. 26, 2 (Apr.), 484-538.
16. GRAHAM, R., KNUTH, D., AND PATASHNIK, O. 1994. Concrete Mathematics. Addison-Wesley, Reading, MA.
17. KLEIN, P. 2002. Preprocessing an undirected planar network to enable fast approximate distance queries. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 820-827.
18. KOWALIK, L. 2003. Short cycles in planar graphs. In Proceedings of 29th International Workshop GraphTheoretic Concepts in Computer Science (WG 2003), H. Bodlaender, Ed. Lecture Notes in Computer Science, vol. 2880. Springer-Verlag, New York, 284-296.
19. LIPTON, R. J., AND TARJAN, R. E. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 2 (Apr.), 177-189.
20. MADER, W. 1968. Homomorphiesätze für graphen. Math. Ann. 178, 154-168.
21. PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1981. The clique problem for planar graphs. Inf. Proc. Lett. 13,4-5, 131-133.
22. RAMALINGAM, G. 1996. Bounded Incremental Computation. Lecture Notes in Computer Science, vol. 1089. Springer-Verlag, New York.
23. RICHARDS, D. 1986. Finding short cycles in planar graphs using separators. J. Algo. 7, 382-394.
24. THORUP, M. 2001. Compact oracles for reachability and approximate distances in planar digraphs. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science. IEEE Computer Science Press Los Alamitos, CA, 242-251.