Evolutionary graph colouring

DOI10.1016/S0020-0190(00)00125-3MaRDI QIDQ294858zbMATH OpenFDO

Authors Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrt'o

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000001253?np=y

zbMATH Keywords

computational complexitygraph colouring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Recommendations

• A recolouring problem on undirected graphs
• scientific article; zbMATH DE number 2080927
• Random coloring evolution on graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Dynamic monopolies in tori.

Cited in

(5)

• Random coloring evolution on graphs
• scientific article; zbMATH DE number 1342294 (Why is no real title available?)
• The \(k\)-coloring fitness landscape
• A new approach to the vertex coloring problem
• A recolouring problem on undirected graphs

This page was built for publication: Evolutionary graph colouring

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