A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs

DOI10.1007/978-3-642-00219-9_24zbMath1213.68469OpenAlexW1581580640MaRDI QIDQ3611857

Aimal Rextin, Patrick Healy

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Small Point-Sets Supporting Graph Stories ⋮ Small point-sets supporting graph stories ⋮ Graph Stories in Small Area ⋮ Graph stories in small area ⋮ Upward Book Embeddings of st-Graphs

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

This page was built for publication: A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs