Improving graph colouring algorithms and heuristics using a novel representation

DOI10.1007/11730095_11MaRDI QIDQ1742608zbMATH OpenOpenAlexFDO

Authors István Juhos, Jano I. van Hemert

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

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

Recommendations

• scientific article; zbMATH DE number 4134072
• Publication:5752591
• scientific article; zbMATH DE number 956855
• Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem
• scientific article; zbMATH DE number 4210190
• A semidefinite programming-based heuristic for graph coloring
• Publication:4206748
• New approximation algorithms for graph coloring
• A heuristic for the convex recoloring problem in graphs

Cited in

(6)

• Evolutionary Computation in Combinatorial Optimization
• Evolutionary Computation in Combinatorial Optimization
• A search space ``cartography for guiding graph coloring heuristics
• Computing the metric dimension of graphs by genetic algorithms
• Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem
• Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742608)