Recent advances in exact crossing minimization (extended abstract)
From MaRDI portal
Publication:5300976
Recommendations
Cites work
- scientific article; zbMATH DE number 3394160 (Why is no real title available?)
- A Depth-First-Search Characterization of Planarity
- A New Approach to Exact Crossing Minimization
- A branch-and-cut approach to the crossing number problem
- Computing crossing numbers in quadratic time
- Experiments on Exact Crossing Minimization Using Column Generation
- Graph Drawing
- On Cotree-Critical and DFS Cotree-Critical Graphs
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- The crossing number of K11 is 100
Cited in
(11)- A branch-and-cut approach to the crossing number problem
- A New Approach to Exact Crossing Minimization
- Graph Drawing
- Experiments on Exact Crossing Minimization Using Column Generation
- An algorithmic development to minimize crossings in electronic circuits
- An SDP approach to multi-level crossing minimization
- An evolutionary formulation of the crossing number problem
- Facets in the crossing number polytope
- Simple realizability of complete abstract topological graphs simplified
- scientific article; zbMATH DE number 2170413 (Why is no real title available?)
- Experiments on exact crossing minimization using column generation
This page was built for publication: Recent advances in exact crossing minimization (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300976)