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

Authors:
Christian Bachmaier;Wolfgang Brunner
Affiliations:
University of Passau, Germany;University of Passau, Germany
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 4
Cited 4

Efficient Planarity Testing

Journal of the ACM (JACM)
Algorithms for multi-level graph planarity testing and layout

Theoretical Computer Science
Cyclic level planarity testing and embedding

GD'07 Proceedings of the 15th international conference on Graph drawing
Minimum level nonplanar patterns for trees

GD'07 Proceedings of the 15th international conference on Graph drawing

Cyclic Leveling of Directed Graphs

Graph Drawing
A global k-level crossing reduction algorithm

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
On the curve complexity of upward planar drawings

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Upward planar drawings on the standing and the rolling cylinders

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.