2026-07-20T11:02:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17657 2024-03-06T11:00:14Z ddc:004 open_access

Packing Odd Walks and Trails in Multiterminal Networks Akhmedov, Maxim Babenko, Maxim Odd path signed and bidirected graph multiflow polynomial algorithm Let G be an undirected network with a distinguished set of terminals T ⊆ V(G) and edge capacities cap: E(G) → ℝ_+. By an odd T-walk we mean a walk in G (with possible vertex and edge self-intersections) connecting two distinct terminals and consisting of an odd number of edges. Inspired by the work of Schrijver and Seymour on odd path packing for two terminals, we consider packings of odd T-walks subject to capacities cap. First, we present a strongly polynomial time algorithm for constructing a maximum fractional packing of odd T-walks. For even integer capacities, our algorithm constructs a packing that is half-integer. Additionally, if cap(δ(v)) is divisible by 4 for any v ∈ V(G)-T, our algorithm constructs an integer packing. Second, we establish and prove the corresponding min-max relation. Third, if G is inner Eulerian (i.e. degrees of all nodes in V(G)-T are even) and cap(e) = 2 for all e ∈ E, we show that there exists an integer packing of odd T-trails (i.e. odd T-walks with no repeated edges) of the same value as in case of odd T-walks, and this packing can be found in polynomial time. To achieve the above goals, we establish a connection between packings of odd T-walks and T-trails and certain multiflow problems in undirected and bidirected graphs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Maxim Akhmedov and Maxim Babenko 2023 Is Part Of LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2023.5 urn:nbn:de:0030-drops-176570 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.5 eng https://creativecommons.org/licenses/by/4.0/legalcode