A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
From MaRDI portal
Publication:3611857
DOI10.1007/978-3-642-00219-9_24zbMath1213.68469MaRDI QIDQ3611857
Publication date: 3 March 2009
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_24
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.)
Cites Work
- Unnamed Item
- Unnamed Item
- Upward drawings of triconnected digraphs.
- Quasi-upward planarity
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- On-line Planar Graph Embedding
- SOFSEM 2005: Theory and Practice of Computer Science
- Graph Drawing