Computing Shortest Paths and Distances in Planar Graphs

Authors:
Hristo Djidjev;Grammati E. Pantziou;Christos D. Zaroliagis
Affiliations:
-;-;-
Venue:
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Year:
1991

Citing 0
Cited 2

Planar graphs, negative weight edges, shortest paths, and near linear time

Journal of Computer and System Sciences - Special issue on FOCS 2001
External data structures for shortest path queries on planar digraphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract