Neural Algorithmic Reasoning for Approximate $k$-Coloring with Recursive Warm Starts

2026-01-08

AI Summary

This study addresses the approximate graph k-coloring problem, which aims to minimize the number of monochromatic edges—i.e., edges connecting adjacent nodes assigned the same color—while using at most k colors. To this end, the authors propose a hybrid approach that integrates graph neural networks (GNNs) with a lightweight greedy local search. The method introduces several key innovations: a degree-weighted loss function, orthogonal initialization of node features, and a recursive warm-start mechanism that leverages a (k−1)-coloring solution as an initial seed to accelerate convergence. Experimental results demonstrate that the proposed framework significantly improves solution efficiency across diverse graph structures: the local search excels on small-scale graphs, while the GNN combined with recursive warm-starting achieves superior performance on large-scale instances.

Technology Category

• Machine Learning: Graph-based Machine Learning
• Search and Optimization: Local Search
• Data Mining & Knowledge Management: Graph Mining, Social Network Analysis & Community

Application Category

• Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphs
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking
• Semantics and Knowledge: Scalable techniques for the creation, curation, publication, maintenance, and consumption of large, Web-based, structured, reusable, knowledge graphs and ontologies

Abstract

Node coloring is the task of assigning colors to the nodes of a graph such that no two adjacent nodes have the same color, while using as few colors as possible. It is the most widely studied instance of graph coloring and of central importance in graph theory; major results include the Four Color Theorem and work on the Hadwiger-Nelson Problem. As an abstraction of classical combinatorial optimization tasks, such as scheduling and resource allocation, it is also rich in practical applications. Here, we focus on a relaxed version, approximate $k$-coloring, which is the task of assigning at most $k$ colors to the nodes of a graph such that the number of edges whose vertices have the same color is approximately minimized. While classical approaches leverage mathematical programming or SAT solvers, recent studies have explored the use of machine learning. We follow this route and explore the use of graph neural networks (GNNs) for node coloring. We first present an optimized differentiable algorithm that improves a prior approach by Schuetz et al. with orthogonal node feature initialization and a loss function that penalizes conflicting edges more heavily when their endpoints have higher degree; the latter inspired by the classical result that a graph is $k$-colorable if and only if its $k$-core is $k$-colorable. Next, we introduce a lightweight greedy local search algorithm and show that it may be improved by recursively computing a $(k-1)$-coloring to use as a warm start. We then show that applying such recursive warm starts to the GNN approach leads to further improvements. Numerical experiments on a range of different graph structures show that while the local search algorithms perform best on small inputs, the GNN exhibits superior performance at scale. The recursive warm start may be of independent interest beyond graph coloring for local search methods for combinatorial optimization.

Problem

• approximate k-coloring
• graph coloring
• combinatorial optimization
• node coloring
• recursive warm starts

Innovation

• recursive warm starts
• graph neural networks
• approximate k-coloring
• differentiable algorithm
• local search