Graph Coloring Using Heat Diffusion
This addresses graph coloring for applications like scheduling and resource allocation, but appears incremental as it applies an existing framework to a known problem.
The paper tackled the graph coloring problem by proposing a solution using the heat diffusion framework, establishing its competitiveness against popular methods.
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.