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

Authors:
Jin-Kao Hao;Jean-Philippe Hamiez;Fred W. Glover
Affiliations:
Université d'Angers, France;Université d'Angers/LERIA, France;OptTek Systems Inc., USA
Venue:
International Journal of Applied Metaheuristic Computing
Year:
2010

Citing 15
Cited 2

Using tabu search techniques for graph coloring

Computing
A randomised 3-colouring algorithm

Discrete Mathematics - Graph colouring and variations
Phase transitions and the search problem

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
On the NP-completeness of the k-colorability problem for triangle-free graphs

Discrete Mathematics
New methods to color the vertices of a graph

Communications of the ACM
Frozen development in graph coloring

Theoretical Computer Science - Phase transitions in combinatorial problems
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics
A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
The 3-Colorability Problem on Graphs with Maximum Degree Four

SIAM Journal on Computing
Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics

Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics
NP-hard graph problems and boundary classes of graphs

Theoretical Computer Science
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
The constrainedness of search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A multilevel tabu search with backtracking for exploring weak schur numbers

EA'11 Proceedings of the 10th international conference on Artificial Evolution
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 uniform or equipartite well-known models, and up to 1500 vertices for the hardest class of flat graphs. This study also validates and reinforces some existing phase transition thresholds for 3-COL.