Extending upward planar graph drawings
From MaRDI portal
Publication:5896867
DOI10.1016/j.comgeo.2020.101668zbMath1474.68218arXiv1902.06575OpenAlexW3027893768MaRDI QIDQ5896867
Fabrizio Frati, Giuseppe Di Battista, Giordano Da Lozzo
Publication date: 7 January 2021
Published in: Lecture Notes in Computer Science, Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.06575
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Extending simple drawings ⋮ Extending upward planar graph drawings ⋮ Unnamed Item ⋮ Upward planar morphs ⋮ Inserting one edge into a simple drawing is hard ⋮ On the upward book thickness problem: combinatorial and complexity results
Cites Work
- Unnamed Item
- Upward planar drawings on the standing and the rolling cylinders
- Strip planarity testing for embedded planar graphs
- Extending partial representations of proper and unit interval graphs
- The partial visibility representation extension problem
- Upward drawings of triconnected digraphs.
- Algorithms for plane representations of acyclic digraphs
- Area requirement and symmetry display of planar upward drawings
- Quasi-upward planarity
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Extending partial representations of subclasses of chordal graphs
- Extending partial representations of interval graphs
- The importance of being proper
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Extending Partial Representations of Circle Graphs
- Extending Partial Representations of Function Graphs and Permutation Graphs
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Optimal Upward Planarity Testing of Single-Source Digraphs
- NP completeness of the edge precoloring extension problem on bipartite graphs
- Partial and Constrained Level Planarity
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
- Planar L-Drawings of Directed Graphs
- Windrose Planarity
- On-Line Planarity Testing
- Testing Planarity of Partially Embedded Graphs
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- Extending upward planar graph drawings
- Upward planar morphs
This page was built for publication: Extending upward planar graph drawings
