Increasing the parallelism of graph coloring via shortcutting.

Ghadeer Alabandi Evan Powers Martin Burtscher

Published in: PPoPP (2020)

Keyphrases

graph coloring
combinatorial problems
constraint satisfaction problems
job shop scheduling
phase transition
np complete problems
hyper heuristics
scheduling problem
max sat
constraint satisfaction
constraint programming
optimization algorithm
metaheuristic
shared memory
np hard
artificial bee colony