What type of study is this?

This is a Experimental Study study (also classified as: Quantitative Study).

September 16, 2025MathematicsOpen Access

A Heuristic for Graph Coloring Based on the Ising Model

View Full Paper

Ask AI

Bookmark

Authors

Proposed heuristic estimates chromatic number in graphs using the Ising model and shows robust performance.

The algorithm effectively estimates the chromatic number without requiring k as an input.
Evaluation on DIMACS graphs frequently led to optimal or near-optimal solutions across various initial strategies.
The approach utilizes a model related to Boltzmann machines minimizing the Ising model Hamiltonian.
The proposed randomized algorithm's parallelism suggests potential for future improvement and adaptability.

Bihani et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark