We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding and if it does not. Our algorithm returns a planar rectilinear drawing if the graph admits one
We study straight-line drawings of graphs where the vertices are placed in convex position in the pl...
A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotoni...
A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular dr...
We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing,...
A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. A graph i...
A rectilinear drawing is an orthogonal grid drawing without bends, possibly with edge crossings, wit...
We give a linear-time algorithm to decide whether a graph has a planar LL-drawing, i.e. a planar dra...
A plane graph is a planar graph with a fixed embedding. In a rectangular drawing of a plane graph, e...
Abstract. A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are...
We show three linear time algorithms for constructing planar straight-line grid drawings of outerpla...
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the ou...
In this paper, we present two polynomial-time algorithms to determine if an outerplanar directed acy...
Testing the planarity of a graph and possibly drawing it without intersections is one of the most fa...
Given a plane graph G (i.e., a planar graph with a fixed planar embedding) and a simple cycle C in G...
An HV-restricted planar graph G is a planar graph with vertex-degree at most four and such that each...
We study straight-line drawings of graphs where the vertices are placed in convex position in the pl...
A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotoni...
A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular dr...
We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing,...
A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. A graph i...
A rectilinear drawing is an orthogonal grid drawing without bends, possibly with edge crossings, wit...
We give a linear-time algorithm to decide whether a graph has a planar LL-drawing, i.e. a planar dra...
A plane graph is a planar graph with a fixed embedding. In a rectangular drawing of a plane graph, e...
Abstract. A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are...
We show three linear time algorithms for constructing planar straight-line grid drawings of outerpla...
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the ou...
In this paper, we present two polynomial-time algorithms to determine if an outerplanar directed acy...
Testing the planarity of a graph and possibly drawing it without intersections is one of the most fa...
Given a plane graph G (i.e., a planar graph with a fixed planar embedding) and a simple cycle C in G...
An HV-restricted planar graph G is a planar graph with vertex-degree at most four and such that each...
We study straight-line drawings of graphs where the vertices are placed in convex position in the pl...
A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotoni...
A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular dr...
DOI
Add to ORKG