1. Proof verification and hardness of approximation problems;Arora,1992
2. Problems easy for tree-decomposable graphs;Arnborg;J. Algorithms,1991
3. The complexity of multiterminal cuts;Dahlhaus;SIAM J. Comput.,1994
4. Algorithm for solution of a problem of maximum flow in networks with power estimation;Dinic;Soviet Math. Dokl.,1970
5. Maximal flow through a network;Ford;Canad. J. Math.,1956