Finding good approximate vertex and edge partitions is NP-hard

An Efficient Heuristic Procedure for Partitioning Graphs

Brian W. Kernighan, Shang Min Lin · Bell System Technical Journal · 1970 · 5.3K citations

Computing, Computer Science, Electrical Engineering +17

Some simplified NP-complete graph problems

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

Computing, Computer Science, Mathematics +11

A Separator Theorem for Planar Graphs

Richard J. Lipton, Robert E. Tarjan · SIAM Journal on Applied Mathematics · 1979 · 1.4K citations

Computing, Computer Science, Mathematics +13

An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

T. Leighton · 1988 · 399 citations

Computing, Computer Science, Algorithms +16

Graph bisection algorithms with good average case behavior

Thanh‐Tung Bui, S.K. Chaudhuri, F. T. Leighton et al. · COMBINATORICA · 1987 · 327 citations

Computing, Computer Science, Mathematics +8