Efficient graph coloring with parallel genetic algorithms
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)
Recommendations
Cited in
(12)- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- Genetic and hybrid algorithms for graph coloring
- scientific article; zbMATH DE number 1696708 (Why is no real title available?)
- scientific article; zbMATH DE number 6616702 (Why is no real title available?)
- An application of a new hybrid genetic algorithm to graph coloring
- scientific article; zbMATH DE number 1342294 (Why is no real title available?)
- scientific article; zbMATH DE number 2076933 (Why is no real title available?)
- Solving graph partitioning problems with parallel metaheuristics
- Parallel metaheuristics: recent advances and new trends
- Parallel Immune System for Graph Coloring
- Computational Science - ICCS 2004
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
This page was built for publication: Efficient graph coloring with parallel genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422958)
