Login / Signup
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths.
Matthias Bentert
André Nichterlein
Malte Renken
Philipp Zschoche
Published in:
SIAM J. Discret. Math. (2023)
Keyphrases
</>
shortest path
minimal surface
shortest path problem
shortest path algorithm
road network
path length
finding the shortest path
routing algorithm
flow graph
geometric structure
minimum cost flow
pairwise
social networks
social network analysis
spatial networks
knn
shortest distance
strongly connected components