Short path queries in planar graphs in constant time

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 143-148

  Kowalik, Łukasz ^a   Kurowski, Maciej ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Planar graph; Queries; Shortest path

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

SHORT PATH QUERIES;

GRAPH THEORY;

EID: 0038447030     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780564.780565     Document Type: Conference Paper

References (7)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, 1993.
2. D. A. Chen and J. Xu. Shortest path queries in planar graphs. In Proc. of the 32nd Annual ACM Symposium on Theory of Computing, pages 469-478, 2000.
3. M. Chrobak and D. Eppstein. Planar orientations with low out-degree and compaction of adjacency matrices. Theoretical Computer Science, 86(2):243-266, 1991.
4. H. Djidjev. Computing the girth of a planar graph. In Proc. 27th International Colloquium on Automata, Languages and Programming, pages 821-831, 2000.
5. D. Eppstein. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms & Applications, 3(3):1-27, 1999.
6. G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM Journal on Computing, 26(2):484-538, April 1997.
7. G. Ramalingam. Bounded Incremental Computation, volume 1089 of LNCS. Springer, 1996.