Computing Radial Drawings on the Minimum Number of Circles
From MaRDI portal
Publication:5301377
Recommendations
- Graph Drawing
- Approximation algorithms for minimizing edge crossings in radial drawings
- Radial drawings of graphs: geometric constraints and trade-offs
- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
- Untangling circular drawings: algorithms and complexity
- A framework and algorithms for circular drawings of graphs
- Efficient Algorithms for Ortho-Radial Graph Drawing.
- Drawing graphs on few circles and few spheres
- Drawing graphs on few circles and few spheres
Cited in
(14)- A force-directed algorithm for drawing directed graphs symmetrically
- Every graph admits an unambiguous bold drawing
- scientific article; zbMATH DE number 6007785 (Why is no real title available?)
- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
- Ortho-radial drawing of graphs
- Towards a topology-shape-metrics framework for ortho-radial drawings
- Efficient Algorithms for Ortho-Radial Graph Drawing.
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
- Graph Drawing
- Computing and Combinatorics
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Improved outerplanarity bounds for planar graphs
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Radial drawings of graphs: geometric constraints and trade-offs
This page was built for publication: Computing Radial Drawings on the Minimum Number of Circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301377)
