Results 1  10
of
18
On Linear Layouts of Graphs
, 2004
"... In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A kstack (resp... ..."
Abstract

Cited by 30 (18 self)
 Add to MetaCart
In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A kstack (resp...
Layout of Graphs with Bounded TreeWidth
 2002, submitted. Stacks, Queues and Tracks: Layouts of Graph Subdivisions 41
, 2004
"... A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straight line grid) drawing of a gr ..."
Abstract

Cited by 25 (19 self)
 Add to MetaCart
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straight line grid) drawing of a graph represents the vertices by points in Z and the edges by noncrossing linesegments. This paper contributes three main results: (1) It is proved that the minimum volume of a certain type of threedimensional drawing of a graph G is closely related to the queuenumber of G. In particular, if G is an nvertex member of a proper minorclosed family of graphs (such as a planar graph), then G has a O(1) O(1) O(n) drawing if and only if G has O(1) queuenumber.
Pathwidth and ThreeDimensional StraightLine Grid Drawings of Graphs
"... We prove that every nvertex graph G with pathwidth pw(G) has a threedimensional straightline grid drawing with O(pw(G) n) volume. Thus for ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
We prove that every nvertex graph G with pathwidth pw(G) has a threedimensional straightline grid drawing with O(pw(G) n) volume. Thus for
Radial Level Planarity Testing and Embedding in Linear Time
 Journal of Graph Algorithms and Applications
, 2005
"... A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines an ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines and the edges are routed strictly downwards without crossings. The extension is characterised by rings, which are level nonplanar biconnected components. Our main results are linear time algorithms for radial level planarity testing and for computing an embedding. We introduce PQRtrees as a new data structure where Rnodes and associated templates for their manipulation are introduced to deal with rings. Our algorithms extend level planarity testing and embedding algorithms which use PQtrees.
Characterization of unlabeled level planar trees
 14TH SYMPOSIUM ON GRAPH DRAWING (GD), VOLUME 4372 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2006
"... Consider a graph G drawn in the plane so that each vertex lies on a distinct horizontal line ℓj = {(x, j)  x ∈ R}. The bijection φ that maps the set of n vertices V to a set of distinct horizontal lines ℓj forms a labeling of the vertices. Such a graph G with the labeling φ is called an nlevel gr ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Consider a graph G drawn in the plane so that each vertex lies on a distinct horizontal line ℓj = {(x, j)  x ∈ R}. The bijection φ that maps the set of n vertices V to a set of distinct horizontal lines ℓj forms a labeling of the vertices. Such a graph G with the labeling φ is called an nlevel graph and is said to be nlevel planar if it can be drawn with straightline edges and no crossings while keeping each vertex on its own level. In this paper, we consider the class of trees that are nlevel planar regardless of their labeling. We call such trees unlabeled level planar (ULP). Our contributions are threefold. First, we provide a complete characterization of ULP trees in terms of a pair of forbidden subtrees. Second, we show how to draw ULP trees in linear time. Third, we provide a linear time recognition algorithm for ULP trees.
An Efficient Fixed Parameter Tractable Algorithm for 1Sided Crossing Minimization
 ALGORITHMICA
, 2004
"... We give an O(ϕ k · n 2) fixed parameter tractable algorithm for the 1SIDED CROSSING MINIMIZATION problem. The constant ϕ in the running time is the golden ratio ϕ = (1 + √ 5)/2 ≈ 1.618. The constant k is the parameter of the problem: the number of allowed edge crossings. ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We give an O(ϕ k · n 2) fixed parameter tractable algorithm for the 1SIDED CROSSING MINIMIZATION problem. The constant ϕ in the running time is the golden ratio ϕ = (1 + √ 5)/2 ≈ 1.618. The constant k is the parameter of the problem: the number of allowed edge crossings.
A FixedParameter Approach to TwoLayer Planarization
, 2002
"... A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn straight. The 2Layer Planarization problem asks if k edges can be deleted from a given graph G so that the remaining graph is biplanar ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn straight. The 2Layer Planarization problem asks if k edges can be deleted from a given graph G so that the remaining graph is biplanar. This problem is NPcomplete, as is the 1Layer Planarization problem in which the permutation of the vertices in one layer is fixed. We give the following fixed parameter tractability results: an O(k ·6 k +G) algorithm for 2Layer Planarization and an O(3 k ·G) algorithm for 1Layer Planarization, thus achieving linear time for fixed k.
Fixed parameter algorithms for onesided crossing minimization revisited
 Graph Drawing
, 2004
"... We exhibit a small problem kernel for the onesided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we improve on the search tree algorithm developed in [7] and derive an O(1.4656 k + kn 2) algorithm f ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We exhibit a small problem kernel for the onesided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we improve on the search tree algorithm developed in [7] and derive an O(1.4656 k + kn 2) algorithm for this problem, where k upperbounds the number of tolerated edge crossings in the drawings of an nvertex graph.
A FixedParameter Approach to 2Layer Planarization
, 2006
"... A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) inthe plane such that there are no edge crossings when edges are drawn as line segments between the layers. In this paper we study the 2LAYER PLANARIZATION problem: Can k edges be deleted from a given graph ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) inthe plane such that there are no edge crossings when edges are drawn as line segments between the layers. In this paper we study the 2LAYER PLANARIZATION problem: Can k edges be deleted from a given graph G so that the remaining graph is biplanar? This problem is NPcomplete, and remains so if the permutation of the vertices in one layer is fixed (the 1LAYER PLANARIZATION problem). We prove that these problems are fixedparameter tractable by giving lineartime algorithms for their solution (for fixed k). In particular, we solve the 2LAYER PLANARIZATION problem in O(k · 6 k +G) time and the 1LAYER PLANARIZATION problem in O(3 k ·G) time. We also show that there are polynomialtime constantapproximation algorithms for both problems.
Parameterized Complexity of Geometric Problems
, 2007
"... This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixedparameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixedparameter in ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixedparameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixedparameter intractability results are surveyed as well. Finally, we give some directions for future research.