An ILP-based Proof System for the Crossing Number Problem
From MaRDI portal
Publication:4606298
DOI10.4230/LIPIcs.ESA.2016.29zbMath1397.68138OpenAlexW2531414784MaRDI QIDQ4606298
Publication date: 2 March 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2016.29
Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (17)
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics ⋮ Star-struck by fixed embeddings: modern crossing number heuristics ⋮ There are no cubic graphs on 26 vertices with crossing number 10 or 11 ⋮ The longest processing time rule for identical parallel machines revisited ⋮ Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ On approximating the incremental knapsack problem ⋮ A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem ⋮ The crossing numbers of join products of four graphs of order five with paths and cycles ⋮ ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH ⋮ Approximating the 3-period incremental knapsack problem ⋮ Unnamed Item ⋮ Characterizing all graphs with 2-exceptional edges ⋮ On the crossing numbers of Cartesian products of wheels and trees ⋮ Unnamed Item ⋮ An improved algorithm for a two-stage production scheduling problem with an outsourcing option ⋮ A survey of graphs with known or bounded crossing numbers ⋮ ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH
Uses Software
This page was built for publication: An ILP-based Proof System for the Crossing Number Problem
