Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search

David Chalupa. Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search. In Martin Middendorf, Christian Blum, editors, Evolutionary Computation in Combinatorial Optimization - 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings. Volume 7832 of Lecture Notes in Computer Science, pages 238-249, Springer, 2013. [doi]

Abstract

Abstract is missing.