Recent Advances in Exact Crossing Minimization (Extended Abstract)

DOI10.1016/j.endm.2008.06.015zbMath1267.05094OpenAlexW2002846750WikidataQ56977247 ScholiaQ56977247MaRDI QIDQ5300976

Petra Mutzel

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

zbMATH Keywords

integer linear programmingcrossing numberbranch-and-cut

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Simple realizability of complete abstract topological graphs simplified

Uses Software

• PIGALE

Cites Work

• Unnamed Item
• A branch-and-cut approach to the crossing number problem
• A New Approach to Exact Crossing Minimization
• A Depth-First-Search Characterization of Planarity
• On Cotree-Critical and DFS Cotree-Critical Graphs
• Computing crossing numbers in quadratic time
• Experiments on Exact Crossing Minimization Using Column Generation
• The crossing number of K₁₁ is 100
• The Complexity of Several Realizability Problems for Abstract Topological Graphs
• Graph Drawing

This page was built for publication: Recent Advances in Exact Crossing Minimization (Extended Abstract)