graph-coloring

This paper presents a randomized algorithm that solves k-coloring on n-vertex graphs in time (2-ε_k)^n for every fixed k, resolving a long-standing open problem in exponential-time algorithms. It builds on hypergraph containers and list-coloring reductions.

This paper proposes an oscillatory neural network (ONN) based solver for Sudoku puzzles by formulating them as graph coloring problems, achieving high accuracy on 4x4 and 9x9 puzzles.