In this paper a fast and simple local search algorithm for graph coloring is presented. The algorithm is easy to implement and requires the storage of only one solution. Experimental results on benchmark instances of the DIMACS Challenge and on random graphs are given
Local search (LS) is a widely used, general approach for solving hard combinatorial search problems,...
The weighted graph coloring problem (WGCP) is an important extension of the graph coloring problem (...
We have developed a new algorithm and software for graph coloring by systematically combining severa...
AbstractIn this paper we present a novel coloring algorithm based on local search. We analyze its pe...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
. This paper presents a new genetic local search algorithm for the graph coloring problem. The algor...
AbstractIn this paper we present a novel coloring algorithm based on local search. We analyze its pe...
AbstractIn this paper we present a novel coloring algorithm based on local search. We analyze its pe...
The Graph Colouring Problem (GCP) is a well known N P-hard problem with many theoretical and practic...
Abstract. Graph coloring is a well known problem from graph theory that, when attacking it with loca...
Local search (LS) is a widely used, general approach for solving hard combinatorial search problems,...
The weighted graph coloring problem (WGCP) is an important extension of the graph coloring problem (...
We have developed a new algorithm and software for graph coloring by systematically combining severa...
AbstractIn this paper we present a novel coloring algorithm based on local search. We analyze its pe...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
In this paper we present a novel coloring algorithm based on local search. We analyze its performanc...
. This paper presents a new genetic local search algorithm for the graph coloring problem. The algor...
AbstractIn this paper we present a novel coloring algorithm based on local search. We analyze its pe...
AbstractIn this paper we present a novel coloring algorithm based on local search. We analyze its pe...
The Graph Colouring Problem (GCP) is a well known N P-hard problem with many theoretical and practic...
Abstract. Graph coloring is a well known problem from graph theory that, when attacking it with loca...
Local search (LS) is a widely used, general approach for solving hard combinatorial search problems,...
The weighted graph coloring problem (WGCP) is an important extension of the graph coloring problem (...
We have developed a new algorithm and software for graph coloring by systematically combining severa...
DOI
Add to ORKG