Add to ORKG© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.Peer Reviewe
AbstractWe characterize the complexity of a number of basic optimization problems for unit disk grap...
Computational problems on graphs often arise in two- or three-dimensional geometric contexts. Such ...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
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...
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show t...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
AbstractUnit disk graphs are the intersection graphs of unit diameter closed disks in the plane. Thi...
Abstract. A bisection of a graph with n vertices is a partition of its vertices into two sets, each ...
In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitionin...
Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which s...
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, us...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two...
AbstractWe characterize the complexity of a number of basic optimization problems for unit disk grap...
Computational problems on graphs often arise in two- or three-dimensional geometric contexts. Such ...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
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...
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show t...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
AbstractUnit disk graphs are the intersection graphs of unit diameter closed disks in the plane. Thi...
Abstract. A bisection of a graph with n vertices is a partition of its vertices into two sets, each ...
In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitionin...
Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which s...
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, us...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two...
AbstractWe characterize the complexity of a number of basic optimization problems for unit disk grap...
Computational problems on graphs often arise in two- or three-dimensional geometric contexts. Such ...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...