Upward Planarity Testing in Practice
DOI10.1145/2699875zbMath1347.68279OpenAlexW2025433012MaRDI QIDQ2828203
Markus Chimani, Robert Zeranski
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2699875
graph drawingcombinatorial algorithmsupward planarityexperimental evaluationimplementationsSAT formulation
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Cites Work
- Bipartite graphs, upward drawings, and planarity
- Upward drawings of triconnected digraphs.
- Quasi-upward planarity
- Upward and quasi-upward planarity testing of embedded mixed graphs
- An experimental comparison of four graph drawing algorithms.
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Upward Planarity Testing: A Computational Study
- Upward Spirality and Upward Planarity Testing
- Towards an implementation of the 3D visibility skeleton
- Efficient Planarity Testing
- On-Line Planarity Testing
- Upward Planarity Testing via SAT
- An Exact Approach to Upward Crossing Minimization
- Layer-free upward crossing minimization
- Grid sifting
- On the Upward Planarity of Mixed Plane Graphs
- Algorithms – ESA 2004
- SOFSEM 2005: Theory and Practice of Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Upward Planarity Testing in Practice
