Upward planar graphs and their duals
From MaRDI portal
Publication:2512656
DOI10.1016/j.tcs.2015.01.003zbMath1312.68156OpenAlexW2039518798MaRDI QIDQ2512656
Christopher Auer, Kathrin Hanauer, Andreas Gleißner, Franz-Josef Brandenburg, Christian Bachmaier
Publication date: 30 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.003
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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Upward planar drawings on the standing and the rolling cylinders
- Upper bounds for monotone planar circuit value and variants
- Upward drawings of triconnected digraphs.
- On the upward embedding on the torus
- Fundamentals of planar ordered sets
- Algorithms for plane representations of acyclic digraphs
- Light sources, obstructions and spherical orders
- Planar lattices and planar graphs
- The complexity of upward drawings on spheres
- Quasi-upward planarity
- Planar acyclic oriented graphs
- Upward planarity testing
- Constant width planar computation characterizes ACC\(^{0}\)
- On the sphericity testing of single source digraphs
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Rolling Upward Planarity Testing of Strongly Connected Graphs
- Upward Spirality and Upward Planarity Testing
- Drawing Recurrent Hierarchies
- Representations of Graphs on a Cylinder
- Classification of Planar Upward Embedding
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- The Duals of Upward Planar Graphs on Cylinders
- Evaluating Monotone Circuits on Cylinders, Planes and Tori
- Digraph embedding
This page was built for publication: Upward planar graphs and their duals
