Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
From MaRDI portal
Publication:6579770
Cites work
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3404264 (Why is no real title available?)
- scientific article; zbMATH DE number 956855 (Why is no real title available?)
- scientific article; zbMATH DE number 970353 (Why is no real title available?)
- 2-opt moves and flips for area-optimal polygonizations
- A Column Generation Approach for Graph Coloring
- A Pruning Procedure for Exact Graph Coloring
- A branch-and-cut algorithm for graph coloring
- A graph coloring algorithm for large scheduling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A hybrid approach for exact coloring of massive graphs
- A memetic algorithm for graph coloring
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- A survey on vertex coloring problems
- An algorithm for drawing general undirected graphs
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- An exact method for graph coloring
- An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Computing optimal hypertree decompositions with SAT
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
- Exact solution of graph coloring problems via constraint programming and column generation
- Exact weighted vertex coloring via branch-and-price
- Hybrid evolutionary algorithms for graph coloring
- Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
- New methods to color the vertices of a graph
- On Monte Carlo tree search for weighted vertex coloring
- Optimality clue for graph coloring problem
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
- Quantum annealing of the graph coloring problem
- SAT-based local search for plane subgraph partitions (CG challenge)
- Shadoks Approach to Low-Makespan Coordinated Motion Planning
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- The smallest hard-to-color graph for algorithm DSATUR
- Using tabu search techniques for graph coloring
Cited in
(2)
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)
