This repository contains online supplementary materials for the work: "A Numerically Exact Branch-and-Price Algorithm with Accelerated Column Enumeration and Decision Diagrams for the Graph Coloring ...

Picture a university in which every quadrimester students have to pick the courses they want to study in the next period of classes. With the list of all the students' preferences, the university has ...

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 ...

The graph coloring problem attempts to assign a color to nodes connected by links under the limitation that no two connected nodes can have the same color. The problem then asks what is the minimum ...

Abstract: Coloring a graph is a known and a classical problem in graph theory. It is also a known NP problem. In a graph G, the solution of coloring a graph is about coloring all the vertices of the ...

Graph coloring is the de facto standard technique for register allocation within a compiler. In this paper we examine the importance of the quality of the coloring algorithm and various extensions of ...

This paper proposes an instantiation of the Reduced Quantum Genetic Algorithm (RQGA) that solves the NP-hard graph coloring problem in O (N 1/2). The proposed implementation solves both vertex and ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...