Graph Coloring

Graph Coloring is a combinatorial optimization problem that involves assigning colors to the vertices of a graph such that no two adjacent vertices share the same color, and it is used to evaluate the effectiveness of algorithms in minimizing the complexity of QUBO formulations.

Papers using Graph Coloring (3)

Improving Parameter Training for VQEs by Sequential Hamiltonian Assembly2023Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries2024Reducing QUBO Density by Factoring Out Semi-Symmetries2024