A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition

The authors present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper 3-colorings for random 3-colorable graphs with up to 11000 vertices and beyond when instances follow the unifor...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of applied metaheuristic computing 2010-10, Vol.1 (4), p.1-24
Hauptverfasser:	Hao, Jin-Kao, Hamiez, Jean-Philippe, Glover, Fred W
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Analysis Apexes Coloring Computation Computer Science Graphs Mathematical models Phase transformations Phase transitions Tabu search Thresholds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!