Two novel evolutionary formulations of the graph coloring problem
From MaRDI portal
Publication:1768599
DOI10.1023/B:JOCO.0000021937.26468.b2zbMath1057.05030WikidataQ115434870 ScholiaQ115434870MaRDI QIDQ1768599
Valmir C. Barbosa, Carlos A. G. Assis, Josina O. Do Nascimento
Publication date: 15 March 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On edge orienting methods for graph coloring ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem ⋮ An evolutionary approach for bandwidth multicoloring problems ⋮ Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions ⋮ Combinatorial optimization in system configuration design ⋮ Graph coloring by multiagent fusion search
Uses Software
