Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time.
Lorenzo BalzottiPaolo Giulio FranciosaPublished in: CSR (2022)
Keyphrases
- planar graphs
- shortest path
- weighted graph
- edge weights
- undirected graph
- minimum weight
- minimum length
- shortest path algorithm
- approximation algorithms
- spanning tree
- graph partitioning
- minimum spanning tree
- travel time
- worst case
- minimum cost
- geodesic distance
- directed graph
- finding the shortest path
- max sat
- directed acyclic graph
- graph cuts
- computational complexity