Wave Function Collapse Coloring: A New Heuristic for Fast Vertex Coloring

08/20/2021
by   Anh Mac, et al.
0

In this paper, we propose a high-speed greedy sequential algorithm for the vertex coloring problem (VCP), based on the Wave Function Collapse algorithm, called Wave Function Collapse Coloring (WFC-C). An iteration of this algorithm goes through three distinct phases: vertex selection, color restriction through wave function collapsing, and domain propagation. In effect, WFC-C propagates color choices or "domain" restrictions beyond immediate neighbourhoods. This heuristic, combined with a series of other greedy optimizations, allows for a fast algorithm that prevents certain color conflicts. Through extensive experiments, we show that WFC-C remains competitive (and occasionally better) in terms of optimal coloring, and dramatically outperforms existing high-speed VCP, with on average speed differences ranging from 2000 times to 16000 times, on the most difficult instances of the DIMACS benchmark.

READ FULL TEXT
research
02/12/2020

An Optimal Decentralized (Δ+ 1)-Coloring Algorithm

Consider the following simple coloring algorithm for a graph on n vertic...
research
09/09/2019

On Domination Coloring in Graphs

A domination coloring of a graph G is a proper vertex coloring of G such...
research
09/12/2019

Effects of Some Operations on Domination Chromatic Number in Graphs

For a simple graph G, a domination coloring of G is a proper vertex colo...
research
02/19/2021

A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic

Given a graph G=(V,E), the b-coloring problem consists in attributing a ...
research
12/29/2018

A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring

We introduce a dynamic version of the graph coloring problem and prove i...
research
01/11/2020

Grundy Coloring friends, Half-Graphs, Bicliques

The first-fit coloring is a heuristic that assigns to each vertex, arriv...
research
01/27/2019

Recycling Solutions for Vertex Coloring Heuristics

The vertex coloring problem is a well-known NP-hard problem and has many...

Please sign up or login with your details

Forgot password? Click here to reset