[LTMG12]
|
R. Lewis, J. Thompson, C. Mumford, J. Gillard (2012).
A wide-ranging computational comparison of high-performance
graph colouring algorithms.
Computers & Operations Research, vol. 39, no. 9, pp. 1933
- 1950.
[ bib |
DOI |
http ]
|
[PHK10]
|
D. C. Porumbel, J.-K. Hao, P. Kuntz (2010).
A search space "cartography" for guiding graph coloring
heuristics.
Computers & Operations Research, vol. 37, no. 4, pp. 769 -
778.
[ bib |
DOI ]
|
[Chi05]
|
M. Chiarandini (2005).
Stochastic Local Search Methods for Highly Constrained
Combinatorial Optimisation Problems.
Ph.D. thesis, Computer Science Department, Darmstadt University of
Technology, Darmstadt, Germany.
[ bib |
.pdf ]
|
[GS05]
|
C. Gomes, B. Selman (2005).
Can Get Satisfaction.
Nature, vol. 435, pp. 751-752.
[ bib ]
|
[BF04]
|
V. C. Barbosa, R. G. Ferreira (2004).
On the phase transitions of graph coloring and independent
sets.
Physica A: Statistical Mechanics and its Applications, vol.
343, no. 1-2.
[ bib ]
|
[HH04]
|
J.-P. Hamiez, J.-K. Hao (2004).
An analysis of solution properties of the graph coloring
problem.
In M. G. C. Resende, J. P. de Sousa, A. Viana (eds.),
Metaheuristics: computer decision-making, pp. 325-345. Kluwer
Academic Publishers, Norwell, MA, USA.
ISBN 1-4020-7653-3.
[ bib ]
|
[Wal02]
|
T. Walsh (2002).
2+p-COL.
In D. S. Johnson, A. Mehrotra, M. Trick (eds.),
Proceedings of the Computational Symposium on Graph Coloring and its
Generalizations, pp. 17-22. Ithaca, New York, USA.
[ bib ]
|
[MPWZ02]
|
R. Mulet, A. Pagnani, M. Weigt, R. Zecchina (2002).
Coloring random graphs.
Physical Review Letters, vol. 89, no. 26.
[ bib ]
|
[CG01]
|
J. Culberson, I. P. Gent (2001).
Frozen Development in Graph Coloring.
Theoretical Computer Science, vol. 265, no. 1-2.
[ bib ]
|
[Cul01]
|
J. Culberson (2001).
Hidden Solutions, Tell-tales, Heuristics and
Anti-heuristics.
In H. Hoos, T. Stuëtzle (eds.), The IJCAI-01
Workshop on Empirical Methods in Artificial Intelligence, pp. 9-14.
[ bib ]
|
[HH01]
|
J.-P. Hamiez, J.-K. Hao (2001).
An analysis of solution properties of the graph coloring
problem.
In Proceedings of the Metaheuristics International Conference,
pp. 193-198. Porto, Portugal.
[ bib ]
|
[Sve01]
|
P. Svenson (2001).
From Neel to NPC: Colouring Small Worlds.
Computing Research Repository, vol. cs.CC/0107015.
[ bib ]
|
[Wal01]
|
T. Walsh (2001).
Search on High Degree Graphs.
In B. Nebel (ed.), Proceedings of the 1st
International Joint Conference on Artificial Intelligence, pp. 266-274.
Morgan Kaufmann, Seattle, Washington, USA.
[ bib ]
|
[CG99]
|
J. Culberson, I. P. Gent (1999).
Well out of reach: Why hard problems are hard.
Tech. Rep. APES-13-1999, APES (Algorithms, Problems, and Empirical
Studies) Group.
[ bib ]
|
[Wal99]
|
T. Walsh (1999).
Search in a Small World.
In T. Dean (ed.), Proceedings of the 16th
International Joint Conference on Artificial Intelligence, pp. 1172-1177.
Morgan Kaufmann, Stockholm, Sweden.
[ bib ]
|
[SN98]
|
P. Svenson, M. G. Nordahl (1998).
Relaxation in graph coloring and satisfiability problems.
Computing Research Repository, vol. cond-mat/9810144.
[ bib ]
|
[Cou97]
|
O. Coudert (1997).
Exact coloring of real-life graphs is easy.
In DAC '97: Proceedings of the 34th annual conference on Design
automation, pp. 121-126. ACM Press, New York, NY, USA, New York, NY, USA.
ISBN 0-89791-920-3.
[ bib |
DOI ]
|
[CL96]
|
J. Culberson, F. Luo (1996).
Exploring the k-colorable Landscape with Iterated Greedy.
vol. 26 of DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, pp. 245-284. American Mathematical Society,
Providence, RI, USA.
[ bib ]
|
[Hog96]
|
T. Hogg (1996).
Refining the Phase Transition in Combinatorial Search.
Artificial Intelligence, vol. 81, no. 1-2, pp. 127-154.
[ bib ]
|
[CBP95]
|
J. Culberson, A. Beacham, D. Papp (1995).
Hiding our Colors.
In Proceedings of the CP'95 Workshop on Studying and Solving
Really Hard Problems, pp. 31-42. Cassis, France.
[ bib |
.html ]
|
[HJdAa94]
|
A. Hertz, B. Jaumard, M. P. de Aragão (1994).
Local optima topology for the k-coloring problem.
Discrete Applied Mathematics, vol. 49, no. 1-3, pp. 257-280.
[ bib |
DOI ]
|
[Cul92]
|
J. Culberson (1992).
Iterated Greedy Graph Coloring and the Difficulty Landscape.
Tech. Rep. 92-07, Department of Computing Science, The University of
Alberta, Edmonton, Alberta, Canada.
[ bib ]
|
[CKT91]
|
P. Cheeseman, B. Kanefsky, W. M. Taylor (1991).
Where the Really Hard Problems Are.
In J. Mylopoulos, R. Reiter (eds.), Proceedings
of the 12th International Joint Conference on Artificial Intelligence, pp.
331-337. Morgan Kaufmann Publishers, San Francisco, CA, USA.
[ bib ]
|