Compact oracles for reachability and approximate distances in planar digraphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 242-251

  Thorup, M ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; OPTIMIZATION; SET THEORY;

PLANAR DIGRAPHS;

GRAPH THEORY;

EID: 0035170891     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959898     Document Type: Conference Paper

References (19)

1. Planar spanners and approximate shortest path queries among obstacles in the plane
2. Planar spanners and approximate shortest path queries among obstacles in the plane
3. Efficient algorithms for shortest path queries in planar digraphs
4. Computing shortest paths and distances in planar graphs
5. Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
6. Fast algorithms for shortest paths in planar graphs, with applications
7. Distance labeling in graphs
8. Fast algorithms for finding nearest common ancestor
9. Faster shortest-path algorithms for planar graphs
10. Sublinear time algorithms for metric space problems
11. A fully dynamic approximation scheme for shortest path problems in planar graphs
12. A separator theorem for planar graphs
13. Informative labeling schemes for graphs
14. Proximity-preserving labeling schemes
15. A fully dynamic data structure for reachability in planar digraphs
16. Dynamic reachability in planar digraphs with one source and one sink
17. Shortcutting planar digraphs
18. Approximate distance oracles