An SPQR-tree-like embedding representation for upward planarity
From MaRDI portal
Publication:2206883
DOI10.1007/978-3-030-35802-0_39OpenAlexW2991386008MaRDI QIDQ2206883
Markus Himmel, Guido Brückner, Ignaz Rutter
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.00352
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
- Orthogonal graph drawing with inflexible edges
- Upward drawings of triconnected digraphs.
- A linear-time algorithm for a special case of disjoint set union
- Planar lattices and planar graphs
- Level planarity: transitivity vs. even crossings
- Bend-minimum orthogonal drawings in quadratic time
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- On-line maintenance of triconnected components with SPQR-trees
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Planar Embeddings with Small and Uniform Faces
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Partial and Constrained Level Planarity
- Dividing a Graph into Triconnected Components
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- Testing Planarity of Partially Embedded Graphs
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- Planarity for clustered graphs
This page was built for publication: An SPQR-tree-like embedding representation for upward planarity
