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

DOI10.1007/978-3-540-87744-8_12zbMath1158.68426OpenAlexW1542686761MaRDI QIDQ3541081

Christian Bachmaier, Wolfgang Brunner

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Upward planar drawings on the standing and the rolling cylinders ⋮ Beyond Level Planarity ⋮ Characterization of unlabeled level planar trees ⋮ Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ Cyclic Leveling of Directed Graphs ⋮ Level-planarity: transitivity vs. even crossings

Cites Work

• Algorithms for multi-level graph planarity testing and layout
• A characterization of level planar graphs
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Radial Level Planarity Testing and Embedding in Linear Time
• Hierarchies and planarity theory
• Efficient Planarity Testing
• Level Planar Embedding in Linear Time
• Cyclic Level Planarity Testing and Embedding
• Minimum Level Nonplanar Patterns for Trees
• Drawing graphs. Methods and models
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs