Cyclic Level Planarity Testing and Embedding
DOI10.1007/978-3-540-77537-9_8zbMATH Open1137.68464OpenAlexW1505458664MaRDI QIDQ5452210FDOQ5452210
Authors: Christian Bachmaier, Wolfgang Brunner, Christof König 
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_8
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Efficient Planarity Testing
- How to draw a planar graph on a grid
- Drawing graphs. Methods and models
- Radial Level Planarity Testing and Embedding in Linear Time
- Level Planar Embedding in Linear Time
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Algorithms for multi-level graph planarity testing and layout
Cited In (11)
- Title not available (Why is that?)
- Beyond level planarity
- Drawing recurrent hierarchies
- Computing hive plots: a combinatorial framework
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Computing hive plots: a combinatorial framework
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Cyclic Leveling of Directed Graphs
- Level-planarity: transitivity vs. even crossings
- Coordinate Assignment for Cyclic Level Graphs
- Upward planar drawings on the standing and the rolling cylinders
This page was built for publication: Cyclic Level Planarity Testing and Embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452210)
