1-bend upward planar slope number of SP-digraphs
From MaRDI portal
Publication:2206732
DOI10.1016/j.comgeo.2020.101628zbMath1450.05035OpenAlexW3009243092MaRDI QIDQ2206732
Giuseppe Liotta, Emilio Di Giacomo, Fabrizio Montecchiani
Publication date: 23 October 2020
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2020.101628
Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Upward Planar Drawings with Three and More Slopes, Upward planar drawings with three and more slopes, Upward planar drawings with two slopes, Universal slope sets for upward planar drawings, Level-planar drawings with few slopes
Cites Work
- Unnamed Item
- The planar slope number of planar partial 3-trees of bounded degree
- On point-sets that support planar graphs
- Drawing orders with few slopes
- Maximum upward planar subgraphs of embedded planar digraphs
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- A better heuristic for orthogonal graph drawings
- Universal slope sets for 1-bend planar drawings
- Outerplanar graph drawings with few slopes
- Lattice diagrams with few slopes
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Graph Drawings with One Bend and Few Slopes
- Planar and Plane Slope Number of Partial 2-Trees
- 1-Bend Upward Planar Drawings of SP-Digraphs
- Upward Spirality and Upward Planarity Testing
- Drawability of Complete Graphs Using a Minimal Slope Set
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Graph Drawing and Applications for Software and Knowledge Engineers
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Graph Drawing
- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
- Upward Planar Drawings and Switch-regularity Heuristics
- The Planar Slope Number of Subcubic Graphs
- Drawing Planar Graphs of Bounded Degree with Few Slopes
- Drawing Outer 1-planar Graphs with Few Slopes
- Universal slope sets for upward planar drawings