Add to ORKGInternational audienceWe are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method
Note: in this text, unless otherwise noted, a graph is always simple. A coloring of a graph is an as...
An exact algorithm is presented for determining the interval chromatic number of a weighted graph. T...
Given an undirected simple graph G, an integer k, and a cost cij for each pair of non-adjacent verti...
International audienceWe are interested in the graph coloring problem. We propose an exact method ba...
The graph coloring problem is the problem of partitioning the vertices of a graph into the smallest ...
International audienceWe are interested in the graph coloring problem. We studied the effectiveness ...
This research focuses on an analysis of different algorithms for the graph vertex coloring problem. ...
AbstractGraph coloring is an important problem with its wide variety of applications. The problem is...
We present a method for solving the independent set formulation of the graph coloring problem (where...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
Many applied problems can be modelised by the vertex coloring problem of a graph, which is NP-comple...
Determining whether the vertices of a graph can be colored using $k$ different colors so that no tw...
We consider the problem of deciding whether a given directed graph can be vertex partitioned into tw...
In this paper, we give an algorithm that computes the chromatic number of a graph in O(5.283n) time...
The graph coloring problem can be stated: “Given an undirected graph, using a minimal number of colo...
Note: in this text, unless otherwise noted, a graph is always simple. A coloring of a graph is an as...
An exact algorithm is presented for determining the interval chromatic number of a weighted graph. T...
Given an undirected simple graph G, an integer k, and a cost cij for each pair of non-adjacent verti...
International audienceWe are interested in the graph coloring problem. We propose an exact method ba...
The graph coloring problem is the problem of partitioning the vertices of a graph into the smallest ...
International audienceWe are interested in the graph coloring problem. We studied the effectiveness ...
This research focuses on an analysis of different algorithms for the graph vertex coloring problem. ...
AbstractGraph coloring is an important problem with its wide variety of applications. The problem is...
We present a method for solving the independent set formulation of the graph coloring problem (where...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
Many applied problems can be modelised by the vertex coloring problem of a graph, which is NP-comple...
Determining whether the vertices of a graph can be colored using $k$ different colors so that no tw...
We consider the problem of deciding whether a given directed graph can be vertex partitioned into tw...
In this paper, we give an algorithm that computes the chromatic number of a graph in O(5.283n) time...
The graph coloring problem can be stated: “Given an undirected graph, using a minimal number of colo...
Note: in this text, unless otherwise noted, a graph is always simple. A coloring of a graph is an as...
An exact algorithm is presented for determining the interval chromatic number of a weighted graph. T...
Given an undirected simple graph G, an integer k, and a cost cij for each pair of non-adjacent verti...