Efficient graph coloring by evolutionary algorithms

DOI10.1007/3-540-48774-3_4MaRDI QIDQ4263885zbMATH OpenFDO

Authors Nicole Drechsler, Wolfgang Günther, Rolf Drechsler

Publication date 21 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48774-3_4

zbMATH Keywords

evolutionary algorithmgraph coloring problem

Mathematics Subject Classification ID

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

Recommendations

• Graph coloring with adaptive evolutionary algorithms
• Hybrid evolutionary algorithms for graph coloring
• scientific article; zbMATH DE number 1703855
• Efficient graph coloring with parallel genetic algorithms
• Evolutionary graph colouring
• Two novel evolutionary formulations of the graph coloring problem
• Genetic and hybrid algorithms for graph coloring
• A memetic algorithm for graph coloring
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

Cited in

(18)

• Graph coloring with adaptive evolutionary algorithms
• A relation-algebraic view on evolutionary algorithms for some graph problems
• Two novel evolutionary formulations of the graph coloring problem
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
• Hybrid evolutionary algorithms for graph coloring
• A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
• A T-coloring algorithm based on multiagent evolution
• Efficient graph coloring with parallel genetic algorithms
• scientific article; zbMATH DE number 1094770 (Why is no real title available?)
• An evolutionary algorithm based on the four-color theorem for location area planning
• The \(k\)-coloring fitness landscape
• Time complexity analysis of RLS and (1+1) EA for the edge coloring problem
• Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem
• Local and global evaluation functions for computational evolution
• Experimentation and discovery in graph theory using an evolutionary tools
• An ordering-based genetic approach to graph coloring
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

This page was built for publication: Efficient graph coloring by evolutionary algorithms

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