Cyclic level planarity testing and embedding

Authors:
Christian Bachmaier;Wolfgang Brunner;Christof König
Affiliations:
University of Passau, Germany;University of Passau, Germany;University of Passau, Germany
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 2
Cited 4

Efficient Planarity Testing

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

Theoretical Computer Science

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

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Drawing planar graphs on points inside a polygon

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
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

In this paper we introduce cyclic level planar graphs, which are a planar version of the recurrent hierarchies from Sugiyama et al. and the cyclic extension of level planar graphs, where the first level is the successor of the last level. We study the testing and embedding problem and solve it for strongly connected graphs in time O(|V| log |V|).