A k-track drawing is a crossing-free 3D straight-line grid drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track number of G. In the existing literature a lower bound of five and an upper bound of fifteen are known for the track number of series-parallel graph. In this paper we reduce this gap for a large subclass of series-parallel graph for which the lower bound remains five but we show an upper bound of eight. We also describe a linear time drawing algorithm that computes a 3D straight-line grid drawing of these graphs in volume 4 × 4 × 2n
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, Θ(n2 ) ...
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
A box is a restricted portion of the three-dimensional integer grid consisting of four parallel line...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
A minimum segment drawing Γ of a planar graph G is a straight line drawing of G that has the minimum...
We show that there exist series-parallel graphs requiring Ω(n2 logn) area in any straight-line or po...
Graph drawing problems originate from diverse application domains. In some, such as software engine...
We prove that every n-vertex graph with path-width pw(G) a three-dimensional straight-line drawing w...
A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order...
AbstractIn this paper, we present a linear time algorithm for constructing linkless drawings of seri...
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices...
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their verti...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, Θ(n2 ) ...
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
A box is a restricted portion of the three-dimensional integer grid consisting of four parallel line...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
A minimum segment drawing Γ of a planar graph G is a straight line drawing of G that has the minimum...
We show that there exist series-parallel graphs requiring Ω(n2 logn) area in any straight-line or po...
Graph drawing problems originate from diverse application domains. In some, such as software engine...
We prove that every n-vertex graph with path-width pw(G) a three-dimensional straight-line drawing w...
A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order...
AbstractIn this paper, we present a linear time algorithm for constructing linkless drawings of seri...
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices...
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their verti...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, Θ(n2 ) ...
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices...