Add to ORKGWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that λ-precision graphs are planar for λ> 1 / √ 2 and give a dichotomy theorem for max-cut computational complexity on λ-precision unit disk graphs
Computational problems on graphs often arise in two- or three-dimensional geometric contexts. Such ...
\textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$,...
We resolve the longstanding open problem concerning the computational complexity of Max Cut on inter...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
Abstract. In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus...
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
The max-bisection and min-bisection problems are to find a partition of the vertices of a graph into...
AbstractUnit disk graphs are the intersection graphs of unit diameter closed disks in the plane. Thi...
International audienceA (unit) disk graph is the intersection graph of closed (unit) disks in the pl...
The complexity of the SIMPLE MAXCUT problem is investigated for several special classes of graphs. I...
AbstractWe characterize the complexity of a number of basic optimization problems for unit disk grap...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
AbstractThe maximum cut problem is proved to be polynomial time solvable on line graphs, while it is...
Computational problems on graphs often arise in two- or three-dimensional geometric contexts. Such ...
\textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$,...
We resolve the longstanding open problem concerning the computational complexity of Max Cut on inter...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
Abstract. In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus...
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
The max-bisection and min-bisection problems are to find a partition of the vertices of a graph into...
AbstractUnit disk graphs are the intersection graphs of unit diameter closed disks in the plane. Thi...
International audienceA (unit) disk graph is the intersection graph of closed (unit) disks in the pl...
The complexity of the SIMPLE MAXCUT problem is investigated for several special classes of graphs. I...
AbstractWe characterize the complexity of a number of basic optimization problems for unit disk grap...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
AbstractThe maximum cut problem is proved to be polynomial time solvable on line graphs, while it is...
Computational problems on graphs often arise in two- or three-dimensional geometric contexts. Such ...
\textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$,...
We resolve the longstanding open problem concerning the computational complexity of Max Cut on inter...