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

Cites Work

The smallest hard-to-color graph for algorithm DSATUR
Title not available (Why is that?)
A new \textsf{DSATUR}-based algorithm for exact vertex coloring
A branch-and-cut algorithm for graph coloring
A survey on vertex coloring problems
A graph coloring algorithm for large scheduling problems
New methods to color the vertices of a graph
An upper bound for the chromatic number of a graph and its application to timetabling problems
Title not available (Why is that?)
An algorithm for drawing general undirected graphs
Hybrid evolutionary algorithms for graph coloring
A graph coloring heuristic using partial solutions and a reactive tabu scheme
A Column Generation Approach for Graph Coloring
A memetic algorithm for graph coloring
Using tabu search techniques for graph coloring
Exact solution of graph coloring problems via constraint programming and column generation
Title not available (Why is that?)
An exact method for graph coloring
Quantum annealing of the graph coloring problem
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
Title not available (Why is that?)
Small Maximal Independent Sets and Faster Exact Graph Coloring
A Pruning Procedure for Exact Graph Coloring
Exact weighted vertex coloring via branch-and-price
An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem
On Monte Carlo tree search for weighted vertex coloring
2-Opt Moves and Flips for Area-optimal Polygonizations
Optimality clue for graph coloring problem
A hybrid approach for exact coloring of massive graphs
Computing optimal hypertree decompositions with SAT
Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
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

Cited In (2)

Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
SAT-boosted tabu search for coloring massive graphs

This page was built for publication: Minimum partition into plane subgraphs: the CG:SHOP challenge 2022

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579770)