Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and occur in many areas, e. g., in scheduling problems and program inheritance structures. In this paper we extend level graphs to cyclic level graphs. Such graphs occur as repeating processes in cyclic scheduling, visual data mining, life sciences, and VLSI. We provide a complete study of strongly connected cyclic level graphs. In particular, we present a linear time algorithm for the planarity testing and embedding problem, and we characterize forbidden subgraphs. Our results generalize earlier work on level graphs.

[1]  Kurt Mehlhorn,et al.  Compaction on the torus [VLSI layout] , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Cyclic Level Planarity Testing and Embedding (Extended Abstract) , 2007 .

[3]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[4]  Christian Bachmaier,et al.  Cyclic Level Planarity Testing and Embedding , 2007, Graph Drawing.

[5]  Kurt Mehlhorn,et al.  Compaction on the Torus , 1988, AWOC.

[6]  W. Sierpinski,et al.  Sur le probléme des courbes gauches en Topologie , 2022 .

[7]  Stephen G. Kobourov,et al.  Minimum Level Nonplanar Patterns for Trees , 2007, GD.

[8]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

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

[10]  Patrick Healy,et al.  Algorithms for multi-level graph planarity testing and layout , 2004, Theor. Comput. Sci..

[11]  G. Battista,et al.  Hierarchies and planarity theory , 1988, IEEE Trans. Syst. Man Cybern..

[12]  Patrick Healy,et al.  A characterization of level planar graphs , 2004, Discret. Math..