Non-Crossing Shortest Paths are Covered with Exactly Four Forests.

Lorenzo Balzotti

Published in: CoRR (2022)

Keyphrases

shortest path
shortest path problem
shortest path algorithm
road network
routing algorithm
flow graph
optimal path
path length
minimum cost flow
geodesic distance
travel time
minimal surface
finding the shortest path
image sequences
weighted graph