Pages that link to "Item:Q951113"

The following pages link to A branch-and-cut approach to the crossing number problem (Q951113):

Displaying 16 items.

• On the crossing numbers of Cartesian products of wheels and trees (Q521759) (← links)
• Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation (Q670454) (← links)
• Non-planar core reduction of graphs (Q1011763) (← links)
• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition (Q1788588) (← links)
• The crossing numbers of join of special disconnected graph on five vertices with discrete graphs (Q2115148) (← links)
• Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
• A combinatorial solution for bridge and torch problem (Q2226477) (← links)
• Iterative refinement for linear programming (Q2830949) (← links)
• Finding Folkman Numbers via MAX CUT Problem (Q3503536) (← links)
• A New Approach to Exact Crossing Minimization (Q3541091) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• Positive cases to the branch point problem (Q4354192) (← links)
• An ILP-based Proof System for the Crossing Number Problem (Q4606298) (← links)
• (Q4677904) (← links)
• Recent Advances in Exact Crossing Minimization (Extended Abstract) (Q5300976) (← links)
• Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)