[1]
Altmanová, K. et al. 2020. On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow. Journal of Graph Algorithms and Applications. 24, 3 (Mar. 2020), 303–322. DOI:https://doi.org/10.7155/jgaa.00534.