Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time.
Lorenzo BalzottiPaolo Giulio FranciosaPublished in: J. Graph Algorithms Appl. (2022)
Keyphrases
- planar graphs
- shortest path
- weighted graph
- edge weights
- undirected graph
- minimum weight
- minimum length
- shortest path algorithm
- minimum spanning tree
- spanning tree
- graph partitioning
- approximation algorithms
- worst case
- travel time
- directed graph
- upper bound
- minimum cost
- directed acyclic graph
- complex networks
- graph structure
- belief propagation
- lower bound
- finding the shortest path