Efficient algorithms for shortest path queries in planar digraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1197 LNCS, Issue , 1997, Pages 151-165

  Djidjev, Hristo N ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INPUT GRAPHS; PLANAR DIGRAPHS; PREPROCESS; PREPROCESSING TIME; SEPARATOR THEOREMS; SHORTEST PATH QUERIES; SHORTEST-PATH; TREE-WIDTH;

ALGORITHMS; COMPUTER SCIENCE; SEPARATORS;

DIRECTED GRAPHS;

EID: 84896796047     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62559-3_14     Document Type: Conference Paper

References (13)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, 1993.
2. S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, and CD Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proceedings of ESA '96, to appear.
3. H. Bodlaender. Dynamic algorithms for graphs with treewidth 2. In WG'93, Lecture Notes in Computer Science, vol. 790, pages 112-124. Springer-Verlag, Berlin, Heidelberg, New York, Tokio, 1994.
4. Shiva Chaudhuri and Christos D. Zaroliagis. Shortest path queries in digraphs of small treewidth. In ICALP'95, Lecture Notes in Computer Science, vol. 944, pages 244-255. Springer-Verlag, Berlin, Heidelberg, New York, Tokio, 1995.
5. E.W. Dijkstra. A note on two problems in connection with graphs. Numer. Math, 1:269-271, 1959.
6. H. Djidjev, G. Pantziou, and C. Zaroliagis. Computing shortest paths and distances in planar graphs. Proc. of 18th International Colloquium on Automata Languages and Programming, pages 327-339, 1991.
7. E. Feuerstein and A.M. Spaccamela. Dynamic algorithms for shortest paths in planar graphs. In WG'91, Lecture Notes in Computer Science, vol 570, pages 187-197. Springer-Verlag, Berlin, Heidelberg, New York, Tokio, 1991.
8. G. N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171-190, 1988.
9. G.N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing, 16:1004-1022, 1987.
10. Michael L. Predman and Robert E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
11. Michael T. Goodrich. Planar separators and parallel polygon triangulation. Proceedings of 24th Symp. on Theory of Computing, pages 507-516, 1992.
12. Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24:1-13, 1977.
13. P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In 26th ACM Symp. Theory of Computing, pages 27-37, 1994.