Classification of Planar Upward Embedding

DOI10.1007/978-3-642-25878-7_39zbMath1311.68164OpenAlexW1540928969MaRDI QIDQ3223973

Christopher Auer, Christian Bachmaier, Andreas Gleißner, Franz-Josef Brandenburg

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_39

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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

Upward planar drawings on the standing and the rolling cylinders ⋮ Beyond Level Planarity ⋮ Data Structures and their Planar Graph Layouts ⋮ On the number of upward planar orientations of maximal planar graphs ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ Upward planar graphs and their duals ⋮ Radial Level Planarity with Fixed Embedding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds for monotone planar circuit value and variants
• On the upward embedding on the torus
• Light sources, obstructions and spherical orders
• The complexity of upward drawings on spheres
• Tesselation and visibility representations of maps on the torus
• Planar acyclic oriented graphs
• 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
• Plane Drawings of Queue and Deque Graphs
• Complexity Theory
• Coordinate Assignment for Cyclic Level Graphs
• Evaluating Monotone Circuits on Cylinders, Planes and Tori
• Digraph embedding