Multilevel Planarity

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 $\ell: V \to \mathcal P(\mathbb 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 \in V$ is $y(v) \in \ell(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.

[1]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[2]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[3]  Michael Jünger,et al.  Level Planar Embedding in Linear Time , 1999, Graph Drawing.

[4]  Günter Rote,et al.  Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity , 2017, Graph Drawing.

[5]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[6]  Patrick Healy,et al.  Practical Level Planarity Testing and Layout with Embedding Constraints , 2007, Graph Drawing.

[7]  Mark de Berg,et al.  Optimal Binary Space Partitions for Segments in the Plane , 2012, Int. J. Comput. Geom. Appl..

[8]  Carlo Mannino,et al.  Upward drawings of triconnected digraphs , 2005, Algorithmica.

[9]  Jan Kratochvíl,et al.  A Kuratowski-type theorem for planarity of partially embedded graphs , 2013, Comput. Geom..

[10]  Michael Forster,et al.  Clustered Level Planarity , 2004, SOFSEM.

[11]  Ignaz Rutter,et al.  Partial and Constrained Level Planarity , 2017, SODA.

[12]  Martin Pergel,et al.  Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs , 2009, J. Graph Algorithms Appl..

[13]  Jan Kratochvíl,et al.  Testing planarity of partially embedded graphs , 2010, SODA '10.

[14]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[15]  Ignaz Rutter,et al.  Beyond Level Planarity , 2016, Graph Drawing.

[16]  Giuseppe Di Battista,et al.  The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity) , 2014, Graph Drawing.