𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm

✍ Scribed by Celia A. Glass; Adam Prügel-Bennett

Book ID
111568491
Publisher
Springer US
Year
2003
Tongue
English
Weight
65 KB
Volume
7
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of a hill-climbing genetic a
Convergence of a hill-climbing genetic algorithm for graph matching
✍ Andrew D.J. Cross; Richard Myers; Edwin R. Hancock 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 793 KB

This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorp

Algorithms for maximum k-colorings and k
Algorithms for maximum k-colorings and k-coverings of transitive graphs
✍ Fǎnicǎ Gavril 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

Consider a graph G and a positive integer k. The maximum k-coloring problem is to color a maximum number of vertices using k colors, such that no two adjacent vertices have the same color. The maximum k-covering problem is to find k disjoint cliques covering a maximum number of vertices. The present