On the complexity of the maximum cut problem

Authors:
Hans L. Bodlaender;Klaus Jansen
Affiliations:
Department of Computer Science Utrecht University P.O.Box 80.089, 3508 TB Utrecht The Netherlands;Institut für Informatik und Praktische Mathematik Christian-Albrechts-Universität zu Kiel Olshausenstr. 40, 24098 Kiel, Germany
Venue:
Nordic Journal of Computing
Year:
2000

Citing 11
Cited 9

Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey

BIT - Ellis Horwood series in artificial intelligence
The NP-completeness column: An ongoing guide

Journal of Algorithms
Incremental modular decomposition

Journal of the ACM (JACM)
Achromatic number is NP-complete for cographs and interval graphs

Information Processing Letters
k-NLC graphs and polynomial algorithms

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Generalized coloring for tree-like graphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Linear algorithms on k-terminal graphs

Linear algorithms on k-terminal graphs

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On algorithms for (P5,gem)-free graphs

Theoretical Computer Science - Graph colorings
Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs

Theoretical Computer Science
Solving some NP-complete problems using split decomposition

Discrete Applied Mathematics
MAX-CUT and containment relations in graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Coloring a graph using split decomposition

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Graphs of separability at most 2

Discrete Applied Mathematics
Note: max-cut and containment relations in graphs

Theoretical Computer Science
An exact algorithm for MAX-CUT in sparse graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of the SIMPLE MAX CUT problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the following classes: chordal graphs, undirected path graphs, split graphs, tripartite graphs, and graphs that are the complement of a bipartite graph. The problem can be solved in polynomial time, when restricted to graphs with bounded treewidth, or cographs. We also give large classes of graphs that can be seen as generalizations of classes of graphs with bounded treewidth and of the class of cographs, and allow polynomial time algorithms for the SIMPLE MAX CUT problem.