Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions

Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena +3

We consider the Shortest Odd Path problem, where given an undirected graph $G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the aim is to find an $(s,t)$-p…