Recent advances in exact crossing minimization (extended abstract)
DOI10.1016/J.ENDM.2008.06.015zbMATH Open1267.05094OpenAlexW2002846750WikidataQ56977247 ScholiaQ56977247MaRDI QIDQ5300976FDOQ5300976
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.015
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- On Cotree-Critical and DFS Cotree-Critical Graphs
- Computing crossing numbers in quadratic time
- Title not available (Why is that?)
- A New Approach to Exact Crossing Minimization
- The crossing number of K11 is 100
- A branch-and-cut approach to the crossing number problem
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- A Depth-First-Search Characterization of Planarity
- Experiments on Exact Crossing Minimization Using Column Generation
- Graph Drawing
Cited In (5)
Uses Software
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)