Minimum partition into plane subgraphs: the CG:SHOP challenge 2022

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Quantum annealing of the graph coloring problem
Exact weighted vertex coloring via branch-and-price
Using tabu search techniques for graph coloring
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
A memetic algorithm for graph coloring
A new \textsf{DSATUR}-based algorithm for exact vertex coloring
An algorithm for drawing general undirected graphs
Hybrid evolutionary algorithms for graph coloring
On Monte Carlo tree search for weighted vertex coloring
Optimality clue for graph coloring problem
A hybrid approach for exact coloring of massive graphs
A graph coloring heuristic using partial solutions and a reactive tabu scheme
An exact method for graph coloring
A branch-and-cut algorithm for graph coloring
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
A survey on vertex coloring problems
A graph coloring algorithm for large scheduling problems
A Pruning Procedure for Exact Graph Coloring
New methods to color the vertices of a graph
A Column Generation Approach for Graph Coloring
Small Maximal Independent Sets and Faster Exact Graph Coloring
An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem
Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
2-Opt Moves and Flips for Area-optimal Polygonizations
An upper bound for the chromatic number of a graph and its application to timetabling problems
The smallest hard-to-color graph for algorithm DSATUR
Computing optimal hypertree decompositions with SAT
Shadoks Approach to Low-Makespan Coordinated Motion Planning
Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
SAT-based local search for plane subgraph partitions (CG challenge)
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring