Optimality clue for graph coloring problem

DOI10.1007/978-3-030-19212-9_22MaRDI QIDQ2327263zbMATH OpenOpenAlexFDO

Authors Laurent Moalic, Alexandre Gondran

Publication date 14 October 2019

Full work available at URL https://arxiv.org/abs/1812.07734

zbMATH Keywords

metaheuristicsnear-optimaloptimality

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Local optimization of colorings of graphs
• CHECKCOL: improved local search for graph coloring
• A search space ``cartography for guiding graph coloring heuristics
• Local optima topology for the \(k\)-coloring problem
• scientific article; zbMATH DE number 4187836

Cited in

(2)

• Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
• Minimum partition into plane subgraphs: the CG:SHOP challenge 2022

This page was built for publication: Optimality clue for graph coloring problem

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