Upward planar drawings with two slopes
From MaRDI portal
Publication:5084713
DOI10.7155/jgaa.00587zbMath1489.05148arXiv2106.02839OpenAlexW4285134430MaRDI QIDQ5084713
Jonathan Klawitter, Tamara Mchedlidze
Publication date: 28 June 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.02839
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Upward Planar Drawings with Three and More Slopes, Visualizing multispecies coalescent trees: drawing gene trees inside species trees, Universal slope sets for upward planar drawings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The planar slope number of planar partial 3-trees of bounded degree
- Drawing orders with few slopes
- Upward drawings of triconnected digraphs.
- Algorithms for plane representations of acyclic digraphs
- Area requirement and symmetry display of planar upward drawings
- A note on optimal area algorithms for upward drawings of binary trees
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Upward planar drawings with three and more slopes
- Algorithms for visualizing phylogenetic networks
- 1-bend upward planar slope number of SP-digraphs
- Drawings of planar graphs with few slopes and segments
- Outerplanar graph drawings with few slopes
- Bounded-degree graphs can have arbitrarily large slope numbers
- Lattice diagrams with few slopes
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Phylogeny
- Planar and Plane Slope Number of Partial 2-Trees
- On the Complexity of the Planar Slope Number Problem
- Upward Spirality and Upward Planarity Testing
- Drawing Ordered (k − 1)–Ary Trees on k–Grids
- Drawing Cubic Graphs with the Four Basic Slopes
- Drawability of Complete Graphs Using a Minimal Slope Set
- Tree Drawings on the Hexagonal Grid
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Orthogonal Drawings of Plane Graphs Without Bends
- The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing
- Drawing Unordered Trees on k-Grids
- Building Blocks of Upward Planar Digraphs
- Algorithms – ESA 2004
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Depth-First Search and Linear Graph Algorithms
- Drawing Graphs with Few Arcs
- Algorithms and Computation
- Universal slope sets for upward planar drawings
- Level-planar drawings with few slopes
- On the complexity of orthogonal compaction
