We investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane, place the remaining vertices to form a planar straight-line drawing of the whole graph. We show that this extensibility problem, proposed in the 2003 Selected Open Problems in Graph Drawing [1], is NP-hard.
A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex is mapped...
: We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generaliz...
Algorithmic extension problems of partial graph representations such as planar graph drawings or geo...
We investigate the computational complexity of the following problem. Given a planar graph in which ...
We investigate the computational complexity of the following problem. Given a planar graph in which ...
We investigate the computational complexity of the following problem. Given a planar graph in which ...
The problem of extending partial geometric graph representations such as plane graphs has received c...
The problem of extending partial geometric graph representations such as plane graphs has received c...
We prove that the following problem is complete for the existential theory of the reals: Given a pla...
Abstract. A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex...
We prove that the following problem is complete for the existential theory of the reals: Given a pla...
We prove that the following problem is complete for the existential theory of the reals: Given a pla...
It is well known that any graph admits a crossing-free straight-line drawing in R-3 and that any pla...
It is well known that any graph admits a crossing-free straight-line drawing in R-3 and that any pla...
Algorithmic extension problems of partial graph representations such as planar graph drawings or geo...
A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex is mapped...
: We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generaliz...
Algorithmic extension problems of partial graph representations such as planar graph drawings or geo...
We investigate the computational complexity of the following problem. Given a planar graph in which ...
We investigate the computational complexity of the following problem. Given a planar graph in which ...
We investigate the computational complexity of the following problem. Given a planar graph in which ...
The problem of extending partial geometric graph representations such as plane graphs has received c...
The problem of extending partial geometric graph representations such as plane graphs has received c...
We prove that the following problem is complete for the existential theory of the reals: Given a pla...
Abstract. A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex...
We prove that the following problem is complete for the existential theory of the reals: Given a pla...
We prove that the following problem is complete for the existential theory of the reals: Given a pla...
It is well known that any graph admits a crossing-free straight-line drawing in R-3 and that any pla...
It is well known that any graph admits a crossing-free straight-line drawing in R-3 and that any pla...
Algorithmic extension problems of partial graph representations such as planar graph drawings or geo...
A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex is mapped...
: We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generaliz...
Algorithmic extension problems of partial graph representations such as planar graph drawings or geo...
DOI
Add to ORKG