On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow

DOI10.1007/978-3-030-24766-9_2zbMath1454.05120OpenAlexW2966444153MaRDI QIDQ2285079

Jan Voborník, Kateřina Altmanová, Petr Kolman

Publication date: 16 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24766-9_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (2)

On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow ⋮ Unnamed Item

This page was built for publication: On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow