Welcome to the InfoSci Platform
Reference Hub5
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition

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

Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover
Copyright: © 2010 |Volume: 1 |Issue: 4 |Pages: 24
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781613502716|DOI: 10.4018/jamc.2010100101
Cite Article Cite Article

MLA

Hamiez, Jean-Philippe, et al. "A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition." IJAMC vol.1, no.4 2010: pp.1-24. http://doi.org/10.4018/jamc.2010100101

APA

Hamiez, J., Hao, J., & Glover, F. W. (2010). A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition. International Journal of Applied Metaheuristic Computing (IJAMC), 1(4), 1-24. http://doi.org/10.4018/jamc.2010100101

Chicago

Hamiez, Jean-Philippe, Jin-Kao Hao, and Fred W. Glover. "A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition," International Journal of Applied Metaheuristic Computing (IJAMC) 1, no.4: 1-24. http://doi.org/10.4018/jamc.2010100101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.