We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show t...
Given an undirected graph G = (V,E), a cut in G is a subset S ⊆ V. Let S = V \S, and let E(S,S) deno...
We study two variants of Maximum Cut, which we call Connected Maximum Cut and Maximum Minimal Cut, i...
The computational complexity of the MaxCut problem restricted to interval graphs has been open since...
AbstractThe maximum cut problem is proved to be polynomial time solvable on line graphs, while it is...
The complexity of the SIMPLE MAXCUT problem is investigated for several special classes of graphs. I...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
\textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$,...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
Although it has been claimed in two different papers that the maximum cardinality cut problem is pol...
We study the boundary of tractability for the max-cut problem in graphs. Our main result shows that ...
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algori...
In this paper, we study the computational complexity of the Maximum Cut problem parameterized above ...
We study the boundary of tractability for the max-cut problem in graphs. Our main result shows that ...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show t...
Given an undirected graph G = (V,E), a cut in G is a subset S ⊆ V. Let S = V \S, and let E(S,S) deno...
We study two variants of Maximum Cut, which we call Connected Maximum Cut and Maximum Minimal Cut, i...
The computational complexity of the MaxCut problem restricted to interval graphs has been open since...
AbstractThe maximum cut problem is proved to be polynomial time solvable on line graphs, while it is...
The complexity of the SIMPLE MAXCUT problem is investigated for several special classes of graphs. I...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
\textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$,...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
Although it has been claimed in two different papers that the maximum cardinality cut problem is pol...
We study the boundary of tractability for the max-cut problem in graphs. Our main result shows that ...
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algori...
In this paper, we study the computational complexity of the Maximum Cut problem parameterized above ...
We study the boundary of tractability for the max-cut problem in graphs. Our main result shows that ...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show t...
Given an undirected graph G = (V,E), a cut in G is a subset S ⊆ V. Let S = V \S, and let E(S,S) deno...
We study two variants of Maximum Cut, which we call Connected Maximum Cut and Maximum Minimal Cut, i...
DOI
Add to ORKG