Shortest odd paths in undirected graphs with conservative weight functions

Download PDF
Open Webpage

Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi

Published: 01 Jan 2024, Last Modified: 30 Aug 2024Discret. Appl. Math. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•The problem with conservative weights and negative edges forming a tree is in P.•FPT algorithm with parameter the number of negative edges (conservativeness assumed).•FPT algorithm with parameter treewidth.