Cyclic Level Planarity Testing and Embedding
From MaRDI portal
Publication:5452210
DOI10.1007/978-3-540-77537-9_8zbMath1137.68464MaRDI QIDQ5452210
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
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Cites Work
- Algorithms for multi-level graph planarity testing and layout
- How to draw a planar graph on a grid
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Radial Level Planarity Testing and Embedding in Linear Time
- Efficient Planarity Testing
- Level Planar Embedding in Linear Time
- Drawing graphs. Methods and models