Login / Signup
Maximum Flows and Parametric Shortest Paths in Planar Graphs.
Jeff Erickson
Published in:
SODA (2010)
Keyphrases
</>
shortest path
planar graphs
weighted graph
shortest path algorithm
road network
minimum weight
finding the shortest path
minimum spanning tree
image sequences
moving objects
high dimensional
special case
belief propagation
travel time
geodesic distance
graph partitioning