Graph Coloring Using Heat Diffusion

TL;DR

This paper introduces a novel heat diffusion-based iterative framework for solving graph coloring problems, demonstrating its competitiveness against existing methods in applications like scheduling and resource allocation.

Contribution

The paper proposes a new heat diffusion framework for graph coloring, offering an alternative to traditional methods and showing promising results.

Findings

Heat diffusion method is competitive with existing algorithms.

The approach is applicable to scheduling and resource allocation.

The method demonstrates efficiency in various graph instances.

Abstract

Graph coloring is a problem with varied applications in industry and science such as scheduling, resource allocation, and circuit design. The purpose of this paper is to establish if a new gradient based iterative solver framework known as heat diffusion can solve the graph coloring problem. We propose a solution to the graph coloring problem using the heat diffusion framework. We compare the solutions against popular methods and establish the competitiveness of heat diffusion method for the graph coloring problem.