Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time.
Jittat FakcharoenpholSatish RaoPublished in: FOCS (2001)
Keyphrases
- shortest path
- planar graphs
- weighted graph
- edge weights
- minimum weight
- minimum length
- shortest path algorithm
- road network
- undirected graph
- minimum spanning tree
- spanning tree
- graph partitioning
- strongly connected components
- graph model
- geodesic distance
- graph cuts
- travel time
- directed graph
- belief propagation
- finding the shortest path