On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow

Katerina Altmanová, Petr Kolman, Jan Voborník. On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow. In Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour, editors, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings. Volume 11646 of Lecture Notes in Computer Science, pages 14-27, Springer, 2019. [doi]

Abstract

Abstract is missing.