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:
Discret. Appl. Math. (2024)
Keyphrases
</>
undirected graph
disjoint paths
shortest path
directed graph
directed acyclic graph
approximation algorithms
path length
graph structure
minimum cost
spanning tree
connected components
multicommodity flow
color images
vertex set
strongly connected
random walk
multi dimensional
higher order