Compact oracles for reachability and approximate distances in planar digraphs

Journal of the ACM

Volumn 51, Issue 6, 2004, Pages 993-1024

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Planar graphs; Reachability and shortest paths oracles

Indexed keywords

DISCRETE STRUCTURES; NONNUMERICAL ALGORITHMS; PLANAR GRAPHS; REACHABILITY AND SHORTEST PATHS ORACLES;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; DATA STRUCTURES; QUERY LANGUAGES;

GRAPH THEORY;

EID: 20444502118     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1039488.1039493     Document Type: Article

References (33)

1. ARIKATI, S., CHEN, D., CHEW, L., DAS, G., SMID, M., AND ZAROLIAGIS, C. 1996. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proceedings of the 4th European Symposium on Algorithms (Barcelona, Spain). Lecture Notes in Computer Science, vol. 1136. Springer-Verlag, New York, 514-528.
2. CHEN, D. 1995. On the all-pairs Euclidian shortest path problem. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif.). ACM, New York, 292-301.
3. CHEN, D., AND Xu, J. 2000. Shortest path queries in planar graphs. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Portland, Ore.). ACM, New York, 469-478.
4. DJIDIEV, H. 1996. Efficient algorithms for shortest path queries in planar digraphs. In Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science (Como, Italy). Lecture Notes in Computer Science, vol. 1197. Springer-Verlag, New York, 151-165.
5. DJIDJEV, H., PANZIOU, G., AND ZAROLIAGIS, C. 1991. Computing shortest paths and distances in planar graphs. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 1991. Springer-Verlag, New York, 327-339.
6. DJIDJEV, H., PANZIOU, G., AND ZAROLIAGIS, C. 1995. Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs. In Proceeding of 10th International Symposium on Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 965. Springer-Verlag, New York, 191-200.
7. FREDERICKSON, G. 1987. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16, 1004-1022.
8. GAVOILLE, C., PELEG, D., PÉRENNES, S., AND RAZ, R. 2001. Distance labeling in graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, D.C.). ACM, New York, 210-219.
9. GILBERT, J. R., HUTCHINSON, J. P., AND TARJAN, R. 1984. A separator theorem for graphs of bounded genus. J. Algorithms 5, 391-407.
10. GUPTA, A., KUMAR, A., AND RASTOGI, R. 2001. Traveling with a pez dispenser (or, routing issues in MPLS). In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Alamitos, Calif., 148-157.
11. GUPTA, A., KUMAR, A., AND THORUP, M. 2003. Tree based MPLS routing. In Proceedings of the 15th ACM Symposium on Parallel Algorithms. ACM, New York, 193-199.
12. HAGERUP, T., MILTERSEN, P., AND PAGH, R. 2001. Deterministic dictionaries. J. Algorithms 41, 1, 69-85.
13. HAREL, D., AND TARJAN, R. 1984. Fast algorithms for finding nearest common ancestor. SIAM J. Comput. 13, 338-355.
14. HENZINGER, M., KLEIN, P., RAO, S., AND SUBRAMANIAN, S. 1997. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55, 3-23.
15. INDYK, P. 1999. Sublinear time algorithms for metric space problems. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing (Atlanta, Ga.). ACM, New York, 428-434.
16. KERNIGHAN, B., AND RITCHIE, D. 1988. The C Programming Language, Second ed. Prentice-Hall.
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 (San Francisco, Calif.). ACM, New York, 820-827.
18. KLEIN, P., AND SUBRAMANIAN, S. 1998. A fully dynamic approximation scheme for shortest path problems in planar graphs. Algorithmica 23, 235-249.
19. LIPTON, R., AND TARJAN, R. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177-189.
20. PELEG, D. 2000a. Informative labeling schemes for graphs. In Proceedings of the 25th Mathematical Foundations of Computer Science (Bratislava, Slovak Republik). Lecture Notes in Computer Science, vol. 1893. Springer-Verlag, New York, 579-588.
21. PELEG, D. 2000b. Proximity-preserving labeling schemes. J. Graph Theory 33, 167-176.
22. ROBERTSON, N., AND SEYMOUR, P. S. 1986. Graph minors V: Excluding a planar graph. J. Combin. Theory, Ser. B 41, 1, 92-114.
23. ROBERTSON, N., AND SEYMOUR, P. S. 2003. Graph minors XVI: Excluding a non-planar graph. J. Combin. Theory, Ser. B 89, 1, 43-76.
24. SANTORO, N., AND KHATIB, R. 1985. Labelling and implicit routing in networks. Comput. J. 28, 1, 5-8.
25. SUBRAMANIAN, S. 1993. A fully dynamic data structure for reachability in planar digraphs. In Proceedings of the 1st European Symposium on Algorithms (Bad Honnef, Germany). Lecture Notes in Computer Science, vol. 726. Springer-Verlag, New York, 372-383.
26. TAMASSIA, R., AND TOLLIS, I. 1993. Dynamic reachability in planar digraphs with one source and one sink. Theoret. Comput. Sci. 119, 331-343.
27. THORUP, M. 1995. Shortcutting planar digraphs. Combin., Prob. Comput. 4, 287-315.
28. THORUP, M. 1999. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46, 362-394.
29. THORUP, M. 2000. On RAM priority queues. SIAM J. Comput. 30, 1, 86-109.
30. THORUP, M., AND ZWICK, U. 2001a. Approximate distance oracles. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing (Crete, Greece). ACM, New York, 183-192.
31. THORUP, M., AND ZWICK, U. 2001b. Compact routing schemes. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (Crete, Greece). ACM, New York, 1-10.
32. VAN LEEUWEN, J., AND TAN, R. 1986. Computer networks with compact routing tables. In The book of L, G. Rozenberg and A. Salomaa, Eds. Springer-Verlag, New York, 259-273.
33. WILLIAMS, J. 1964. Heapsort. Commun. ACM 7, 5, 347-348.