Simple and Improved Parameterized Algorithms for Multiterminal Cuts

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Mathematical Programming, Engineering, Parameterized Complexity +13

The Complexity of Multiterminal Cuts

Elias Dahlhaus, D. S. Johnson, Christos H. Papadimitriou et al. · SIAM Journal on Computing · 1994 · 659 citations

Mathematical Programming, Computational Complexity Theory, Engineering +18

Beyond the flow decomposition barrier

Andrew V. Goldberg, Satish Rao · Journal of the ACM · 1998 · 470 citations · Full text

Mathematical Programming, Residual Arc Capacities, Branch-and-bound Algorithm +23

Algorithm for solution of a problem of maximum flow in networks with power estimation

E. A. Dinic · Medical Entomology and Zoology · 1970 · 391 citations

Power Network, Maximum Flow, Network Science +8

Multi-Commodity Network Flows

T. C. Hu · Operations Research · 1963 · 390 citations

Mathematical Programming, Directed Graph, Engineering +22