From Cliques to Colorings and Back Again
Published in Constraint Programming 2022, 2022
We present an exact algorithm for graph coloring and maximum clique problems based on SAT technology.
Download here
Published in Constraint Programming 2022, 2022
We present an exact algorithm for graph coloring and maximum clique problems based on SAT technology.
Download here
Published in Constraints 2022, 2022
We compare the performance of different portfolios of variable orderings on an algorithm that uses decision diagrams to compute lower bounds on the chromatic number of a graph
Recommended citation: Karahalios and van-Hoeve (2022). "Variable Ordering for Decision Diagrams." Constraints 2022. https://link.springer.com/article/10.1007/s10601-021-09325-6