Shortest odd paths in undirected graphs with conservative weight functions

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)-path with odd length and, among all such paths, of minimum weight. For the case when the weight function is conservative, i.e., whe...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 357; pp. 34 - 50
Main Authors:	Jüttner, Alpár, Király, Csaba, Mendoza-Cadena, Lydia Mirabel, Pap, Gyula, Schlotter, Ildikó, Yamaguchi, Yutaro
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.11.2024
Subjects:	Fixed-parameter algorithms Monadic second-order logic Parity constrained odd path Shortest odd path Treewidth Fixed-parameter algorithms Shortest odd path Monadic second-order logic Parity constrained odd path Treewidth
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!