Multilevel Planarity

10/31/2018
by   Lukas Barth, et al.
0

In this paper, we introduce and study the multilevel-planarity 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 multilevel-planar drawing of G is a planar drawing of G such that the y-coordinate of each vertex v ∈ V is y(v) ∈ℓ(v), and each edge is drawn as a strictly y-monotone curve. We present linear-time algorithms for testing multilevel planarity of embedded graphs with a single source and of oriented cycles. Complementing these algorithmic results, we show that multilevel-planarity testing is NP-complete even in very restricted cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2020

Drawing Two Posets

We investigate the problem of drawing two posets of the same ground set ...
research
08/30/2017

Planar L-Drawings of Directed Graphs

We study planar drawings of directed graphs in the L-drawing standard. W...
research
02/18/2019

Extending Upward Planar Graph Drawings

In this paper we study the computational complexity of the Upward Planar...
research
08/29/2017

Aligned Drawings of Planar Graphs

Let G be a graph topological embedded in the plane and let A be an arra...
research
07/25/2023

Upward Planarity Testing of Biconnected Outerplanar DAGs Solves Partition

We show an O(n)-time reduction from the problem of testing whether a mul...
research
06/25/2020

Multilevel Typed Graph Transformations

Multilevel modeling extends traditional modeling techniques with a poten...
research
07/05/2020

Complexity of the Multilevel Critical Node Problem

In this work, we analyze a sequential game played in a graph called the ...

Please sign up or login with your details

Forgot password? Click here to reset