1. An O˜(mn) Gomory-Hu tree construction algorithm for unweighted graphs;Bhalgat,2007
2. Algorithm for solution of a problem of maximum flow in a network with power estimation;Dinic;Sov. Math. Dokl.,1970
3. On the structure of a family of minimal weighted cuts in a graph;Dinits,1976
4. On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki;Frank,1994
5. Local flow partitioning for faster edge connectivity;Henzinger,2017