Upward Planarity Testing: A Computational Study

DOI10.1007/978-3-319-03841-4_2MaRDI QIDQ2867639zbMATH OpenOpenAlexFDO

Authors Markus Chimani, Robert Zeranski

Publication date 20 December 2013

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03841-4_2

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An Improved Upward Planarity Testing Algorithm and Related Applications
• Upward planarity testing
• Algorithms – ESA 2004
• Upward planarity testing in practice: SAT formulations and comparative study
• On the computational complexity of upward and rectilinear planarity testing
• TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
• SOFSEM 2005: Theory and Practice of Computer Science
• Upward planarity testing via SAT
• Improving the running time of embedded upward planarity testing
• Planarity testing revisited

Cited in

(9)

• The complexity of upward drawings on spheres
• On the computational complexity of upward and rectilinear planarity testing
• Upward planarity testing in practice: SAT formulations and comparative study
• Upward planarity testing via SAT
• Layer-free upward crossing minimization
• Graph Drawing
• Upward planarity testing of biconnected outerplanar DAGs solves partition
• Clustered planarity testing revisited
• Improving the running time of embedded upward planarity testing

This page was built for publication: Upward Planarity Testing: A Computational Study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867639)