Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem

DOI10.1007/978-3-540-70807-0_11zbMath1159.90497OpenAlexW2120375578MaRDI QIDQ3625017

István Juhos, Jano I. van Hemert

Publication date: 7 May 2009

Published in: Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70807-0_11

zbMATH Keywords

heuristicsgraph colouringgraph homomorphismsevolutionary computationgraph representationgraph contraction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem