Login / Signup
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions.
Alpár Jüttner
Csaba Király
Lydia Mirabel Mendoza Cadena
Gyula Pap
Ildikó Schlotter
Yutaro Yamaguchi
Published in:
CoRR (2023)
Keyphrases
</>
undirected graph
disjoint paths
shortest path
directed graph
approximation algorithms
directed acyclic graph
path length
complex networks
multicommodity flow
connected components
special case
dynamic programming
graph structure
strongly connected
vertex set