This repository provides the Python implementation for a comparative study of two prominent heuristic algorithms for solving Constraint Satisfaction Problems (CSPs): the Min-Conflicts algorithm and ...

Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...

This project is a Python implementation of a greedy algorithm to color the vertices of a graph, inspired by the Four-Color Theorem. The program reads a graph from a file, assigns colors to each vertex ...