Fast balanced partitioning is hard even on grids and trees

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

Engineering, Graph Theory, Np-complete Graph Problems +6

Graphcut textures

Vivek Kwatra, Arno Schödl, Irfan Essa et al. · 2003 · 1.2K citations

Geometric Modeling, Machine Vision, Image Analysis +12

An optimal graph theoretic approach to data clustering: theory and its application to image segmentation

Zhenyu Wu, Richard M. Leahy · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1993 · 1.1K citations

Cluster Computing, Engineering, Network Analysis +18

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Tom Leighton, Satish Rao · Journal of the ACM · 1999 · 816 citations · Full text

Graphcut textures

Vivek Kwatra, Arno Schödl, Irfan Essa et al. · ACM Transactions on Graphics · 2003 · 761 citations · Full text

Geometric Modeling, Machine Vision, Image Analysis +12