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

DOI10.1007/978-3-540-87744-8_12MaRDI QIDQ3541081zbMATH OpenOpenAlexFDO

Authors 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 representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Cyclic Level Planarity Testing and Embedding
• Level Planar Embedding in Linear Time
• Multilevel planarity
• Practical Level Planarity Testing and Layout with Embedding Constraints
• Beyond level planarity: cyclic, torus, and simultaneous level planarity

Cites work

• A characterization of level planar graphs
• Algorithms for multi-level graph planarity testing and layout
• Cyclic Level Planarity Testing and Embedding
• Drawing graphs. Methods and models
• Efficient Planarity Testing
• Hierarchies and planarity theory
• scientific article; zbMATH DE number 4072377 (Why is no real title available?)
• scientific article; zbMATH DE number 3315017 (Why is no real title available?)
• Level Planar Embedding in Linear Time
• Minimum Level Nonplanar Patterns for Trees
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Radial Level Planarity Testing and Embedding in Linear Time

Cited in

(14)

• Level-planarity: transitivity vs. even crossings
• Beyond level planarity: cyclic, torus, and simultaneous level planarity
• Beyond level planarity
• Cyclic Leveling of Directed Graphs
• Upward planar drawings on the standing and the rolling cylinders
• Level Planar Embedding in Linear Time
• scientific article; zbMATH DE number 1377359 (Why is no real title available?)
• Testing Planarity of Partially Embedded Graphs
• Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
• Cyclic Level Planarity Testing and Embedding
• Practical Level Planarity Testing and Layout with Embedding Constraints
• Constrained level planarity is FPT with respect to the vertex cover number
• Constrained and ordered level planarity parameterized by the number of levels
• Characterization of unlabeled level planar trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541081)