Three new upper bounds on the chromatic number

Abstract

International audienceThis paper introduces three new upper bounds on the chromatic number, without making any assumptions on the graph structure. The first one, ξ, is based on the number of edges and nodes, and is to be applied to any connected component of the graph, whereas ζ and η are based on the degree of the nodes in the graph. The computation complexity of the three-bound computation is assessed. Theoretical and computational comparisons are also made with five well-known bounds from the literature, which demonstrate the superiority of the new upper bounds

A mathematical model and a metaheuristic approach for a memory allocation problem

“…A close related problem is to determine the minimum number of memory banks with infinite capacity so as to have no open conflicts, this turns out to be the classical graph coloring problem (Diestel 2005;Soto et al 2009). …”

A multiple neighborhood search for dynamic memory allocation in embedded systems

“…The register allocation problem (Krause 2014) relates to the simple version of the memory allocation problem addressed in (Soto et al 2009(Soto et al , 2010. This problem consists of allocating variables in a computer program to hardware registers in a processor.…”

Solving Large Maximum Clique Problems on a Quantum Annealer

“…Likewise, we consider the following two lower bounds: It should be noted that there are many other easily computable upper and lower bounds for maximum clique, maximum independent set, and chromatic number that generally apply to any type of graph (Soto et al, 2011;Elphick and Wocjan, 2018). However, in experiments we conducted (not reported in this article) those generally applicable bounds proved to be quite conservative, with the exception of the bound of (Budinich, 2003, eq. (4)) which we employ for high densities.…”