Circular graph drawings with large crossing angles
From MaRDI portal
Recommendations
Cited in
(10)- A heuristic approach towards drawings of graphs with high crossing resolution
- A greedy heuristic for crossing-angle maximization
- A framework and algorithms for circular drawings of graphs
- Are crossings important for drawing large graphs?
- Circular right-angle crossing drawings in linear time
- Maximizing the total resolution of graphs
- Improved Circular Layouts
- Graph Drawing
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- scientific article; zbMATH DE number 7759289 (Why is no real title available?)
This page was built for publication: Circular graph drawings with large crossing angles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4914458)