DIMACS TR: 2006-03

An exact algorithm for MAX-CUT in sparse graphs

Authors: F. Della Croce, M. J. Kaminski and V. Th. Paschos


We Study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time $O^*(2^{(1-(2/\Delta))n})$. We also describe a MAX-CUT algorithm for general graphs. Its time complexity is $O^*(2^{mn/(m+n)})$. Both algorithms use polynomial space.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2006/2006-03.ps.gz
DIMACS Home Page