An Improved Upward Planarity Testing Algorithm and Related Applications
From MaRDI portal
Recommendations
Cites work
- Algorithms – ESA 2004
- Algorithms for plane representations of acyclic digraphs
- Fundamentals of planar ordered sets
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- On the computational complexity of upward and rectilinear planarity testing
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Quasi-upward planarity
- SOFSEM 2005: Theory and Practice of Computer Science
- Upward drawings of triconnected digraphs.
- Upward Planar Drawing of Single-Source Acyclic Digraphs
Cited in
(6)- Quasi-upward planarity
- On the computational complexity of upward and rectilinear planarity testing
- Upward Planarity Testing: A Computational Study
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- Graph Drawing
- Improving the running time of embedded upward planarity testing
This page was built for publication: An Improved Upward Planarity Testing Algorithm and Related Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605509)