Southampton
metadata only
Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm
This paper examines the best current algorithm for solving the Chromatic Number Problem, due to Galinier and Hao (Journal of Combinatorial Optimization,1999, 3(4), pp 379-397). The algorithm combines a Genetic Algorithm with Tabu Search. We show that the algorithm remains powerful even if the Tabu S
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity#799032
- From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity#797617
Record · ID 824270
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive