Classification of planar upward embedding
From MaRDI portal
Recommendations
Cites work
- Complexity Theory
- Constant width planar computation characterizes ACC\(^{0}\)
- Coordinate Assignment for Cyclic Level Graphs
- Digraph embedding
- Evaluating Monotone Circuits on Cylinders, Planes and Tori
- Graphs on surfaces
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 1821399 (Why is no real title available?)
- scientific article; zbMATH DE number 3246034 (Why is no real title available?)
- Light sources, obstructions and spherical orders
- On the computational complexity of upward and rectilinear planarity testing
- On the sphericity testing of single source digraphs
- On the upward embedding on the torus
- Planar acyclic oriented graphs
- Plane Drawings of Queue and Deque Graphs
- Tesselation and visibility representations of maps on the torus
- The complexity of upward drawings on spheres
- Upper bounds for monotone planar circuit value and variants
Cited in
(12)- On the upward embedding on the torus
- A characterization of horoidal digraphs
- 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
- Rolling upward planarity testing of strongly connected graphs
- Beyond level planarity
- Upward planar drawings on the standing and the rolling cylinders
- Data Structures and their Planar Graph Layouts
- Radial level planarity with fixed embedding
- Upward planar morphs
- Planar classification of objects
This page was built for publication: Classification of planar upward embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223973)