Overcoming barriers by a cluster-moving genetic algorithm

Hybrid genetic algorithms (GAs) for the graph partitioning problem are described. The algorithms include a fast local improvement heuristic. One of the novel features of these algorithms is the schema preprocessing phase that improves GAs' space ...

Let K p be a complete graph of order p ≥ 2. A K p-free k-coloring of a graph H is a partition of V ( H ) into V 1 , V 2 … , V k such that H [ V i ] does not contain K p for each i ≤ k. In 1977 Borodin and Kostochka conjectured that any graph H ...

The graph partitioning problem occurs in numerous applications such as circuit placement, matrix factorization, load balancing, and community detection. For this problem, genetic algorithm is a representative approach with competitive performance with ...