
Drawing Two Posets
We investigate the problem of drawing two posets of the same ground set ...
read it

Planar LDrawings of Directed Graphs
We study planar drawings of directed graphs in the Ldrawing standard. W...
read it

Aligned Drawings of Planar Graphs
Let G be a graph topological embedded in the plane and let A be an arra...
read it

Convex Hulls and Simple Colourings in Directed and 2edgeColoured Graphs
An oriented graph (2edgecoloured graph) is complete convex when the co...
read it

Drawing Clustered Graphs on Disk Arrangements
Let G=(V, E) be a planar graph and let C be a partition of V. We refer t...
read it

Multilevel Typed Graph Transformations
Multilevel modeling extends traditional modeling techniques with a poten...
read it

Graph Stories in Small Area
We study the problem of drawing a dynamic graph, where each vertex appea...
read it
Multilevel Planarity
In this paper, we introduce and study the multilevelplanarity testing problem, which is a generalization of upward planarity and level planarity. Let G = (V, E) be a directed graph and let ℓ: V → P( Z) be a function that assigns a finite set of integers to each vertex. A multilevelplanar drawing of G is a planar drawing of G such that the ycoordinate of each vertex v ∈ V is y(v) ∈ℓ(v), and each edge is drawn as a strictly ymonotone curve. We present lineartime algorithms for testing multilevel planarity of embedded graphs with a single source and of oriented cycles. Complementing these algorithmic results, we show that multilevelplanarity testing is NPcomplete even in very restricted cases.
READ FULL TEXT
Comments
There are no comments yet.