1. Length-bounded cuts: proper interval graphs and structural parameters;Bentert,2020
2. Maximal flow through a network;Ford;Can. J. Math.,1956
3. Dinitz' algorithm: the original version and Even's version;Dinitz,2006
4. An O(|V|3) algorithm for finding maximum flows in networks;Malhotra;Inf. Process. Lett.,1978
5. Combinatorial Optimization: Polyhedra and Efficiency, Vol. 24;Schrijver,2003