Benchmark图着色
graph coloring
A benchmark for the graph coloring problem, which requires assigning colors to the vertices of a graph so that adjacent vertices receive different colors, used to evaluate constraint satisfaction and combinatorial optimization capabilities.
Timeline (last 90 days)
Oct 21
Binary Discrete Diffusion was systematically evaluated on three constraint satisfaction tasks: Sudoku-Extreme, Boxoban (Sokoban planning), and graph coloring.
Unverified50%