Two novel evolutionary formulations of the graph coloring problem

DOI10.1023/B:JOCO.0000021937.26468.B2MaRDI QIDQ1768599zbMATH OpenWikidataFDO

Authors 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)

Full work available at URL https://doi.org/10.1023/B:JOCO.0000021937.26468.B2

zbMATH Keywords

evolutionary algorithmsgenetic algorithmsgenetic programminggraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35)

Recommendations

• An ordering-based genetic approach to graph coloring
• A novel evolutionary formulation of the maximum independent set problem
• scientific article; zbMATH DE number 1342294
• Graph coloring with adaptive evolutionary algorithms
• Evolutionary Computation in Combinatorial Optimization

Cited in

(16)

• Combinatorial optimization in system configuration design
• Graph coloring by multiagent fusion search
• Graph coloring with adaptive evolutionary algorithms
• A novel evolutionary formulation of the maximum independent set problem
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
• On edge orienting methods for graph coloring
• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
• An evolutionary approach for bandwidth multicoloring problems
• scientific article; zbMATH DE number 1342294 (Why is no real title available?)
• scientific article; zbMATH DE number 1094770 (Why is no real title available?)
• The \(k\)-coloring fitness landscape
• Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
• Experimentation and discovery in graph theory using an evolutionary tools
• An ordering-based genetic approach to graph coloring
• A supernodal formulation of vertex colouring with applications in course timetabling
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Two novel evolutionary formulations of the graph coloring problem

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