Counting edge crossings in a 2-layered drawing
From MaRDI portal
Publication:2390316
Recommendations
- Simple and efficient bilayer cross counting
- Simple and Efficient Bilayer Cross Counting
- An improved bound on the one-sided minimum crossing number in two-layered drawings
- Drawing bipartite graphs in two layers with specified crossings
- A faster fixed parameter algorithm for two-layer crossing minimization
Cites work
Cited in
(7)- Drawing bipartite graphs in two layers with specified crossings
- An improved bound on the one-sided minimum crossing number in two-layered drawings
- A faster fixed parameter algorithm for two-layer crossing minimization
- Simple and Efficient Bilayer Cross Counting
- Simple and efficient bilayer cross counting
- Approximation algorithms for minimizing edge crossings in radial drawings
- Quantum graph drawing
This page was built for publication: Counting edge crossings in a 2-layered drawing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390316)