Login / Signup
Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time
Shay Mozes
Christian Wulff-Nilsen
Published in:
CoRR (2009)
Keyphrases
</>
shortest path
planar graphs
worst case
shortest path algorithm
lower bound
road network
weighted graph
special case
upper bound
finding the shortest path