An Improved Upward Planarity Testing Algorithm and Related Applications
From MaRDI portal
Publication:3605509
DOI10.1007/978-3-642-00202-1_29zbMath1211.68458OpenAlexW1492593931MaRDI QIDQ3605509
Sarmad Abbasi, Aimal Rextin, Patrick Healy
Publication date: 24 February 2009
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_29
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upward drawings of triconnected digraphs.
- Fundamentals of planar ordered sets
- Algorithms for plane representations of acyclic 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
- Algorithms – ESA 2004
- SOFSEM 2005: Theory and Practice of Computer Science