Greedy splitting algorithms for approximating multiway partition problems

A new approach to the maximum-flow problem

Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text

Computing, Computer Science, Algorithms +16

Multi-Terminal Network Flows

Ralph E. Gomory, T. C. Hu · Journal of the Society for Industrial and Applied Mathematics · 1961 · 948 citations

Computing, Communication, Computer Science +9

The Complexity of Multiterminal Cuts

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

Computing, Computer Science, Mathematics +15

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Satoru Iwata, Lisa Fleischer, Satoru Fujishige · Journal of the ACM · 2001 · 585 citations

Computing, Computer Science, Mathematics +14

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Hiroshi Nagamochi, Toshihide Ibaraki · SIAM Journal on Discrete Mathematics · 1992 · 395 citations

Computing, Computer Science, Algorithms +12