Improving graph colouring algorithms and heuristics using a novel representation

DOI10.1007/11730095_11zbMath1401.68290OpenAlexW1604039765MaRDI QIDQ1742608

Jano I. van Hemert, István Juhos

Publication date: 12 April 2018

Full work available at URL: https://doi.org/10.1007/11730095_11

zbMATH Keywords

heuristicsrepresentationgraph colouringmerge model

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Computing the metric dimension of graphs by genetic algorithms

This page was built for publication: Improving graph colouring algorithms and heuristics using a novel representation