Crossing reduction in circular layouts
From MaRDI portal
Recommendations
Cited in
(29)- An improved force-directed graph layout algorithm based on aesthetic criteria
- Stack-number is not bounded by queue-number
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge
- An annotated bibliography on 1-planarity
- The Bundled Crossing Number
- Circular right-angle crossing drawings in linear time
- Crossing Minimisation Heuristics for 2-page Drawings
- scientific article; zbMATH DE number 5763167 (Why is no real title available?)
- Improved Circular Layouts
- Visual Analysis of One-to-Many Matched Graphs
- Group-Level Analysis and Visualization of Social Networks
- On circular layouts∗
- Crossing reduction by windows optimization
- The Turing Test for Graph Drawing Algorithms
- An improved fixed-parameter algorithm for one-page crossing minimization
- scientific article; zbMATH DE number 7236457 (Why is no real title available?)
- Minimizing crossings in constrained two-sided circular graph layouts
- Multi-circular Layout of Micro/Macro Graphs
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- On 3-coloring circle graphs
- On 3-coloring circle graphs
- The parameterized complexity of extending stack layouts
- Recognizing 2-layer and outer k-planar graphs
- Visualizing treewidth
- The parameterized complexity of extending stack layouts
- Visualizing treewidth
- Complex systems: features, similarity and connectivity
- Removing even crossings
- Crossing minimization in extended level drawings of graphs
This page was built for publication: Crossing reduction in circular layouts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710814)