Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time.

Lorenzo Balzotti Paolo Giulio Franciosa

Published in: CIAC (2023)

Keyphrases

shortest path
planar graphs
weighted graph
minimum length
shortest path algorithm
minimum weight
road network
worst case
travel time
bayesian networks
geodesic distance
finding the shortest path
knn
random walk
approximate inference