[DR08]
|
I. Dukanovic, F. Rendl (2008).
A semidefinite programming-based heuristic for graph
coloring.
Discrete Applied Mathematics, vol. 156, no. 2, pp. 180-189.
[ bib |
DOI ]
|
[Gel08]
|
A. V. Gelder (2008).
Another look at graph coloring via propositional
satisfiability.
Discrete Applied Mathematics, vol. 156, no. 2, pp. 230-243.
[ bib |
DOI ]
|
[Pre08]
|
S. D. Prestwich (2008).
Generalised graph colouring by a hybrid of local search and
constraint programming.
Discrete Applied Mathematics, vol. 156, no. 2, pp. 148-158.
[ bib |
DOI ]
|
[DR05]
|
I. Dukanovic, F. Rendl (2005).
A semidefinite programming based heuristic for graph
coloring.
Working paper available through the Optimization Online repository.
Universitaet Klagenfurt, Institut für Mathematik.
[ bib ]
|
[CD02]
|
M. Caramia, P. Dell'Olmo (2002).
Constraint Propagation in Graph Coloring.
Journal of Heuristics, vol. 8, no. 1, pp. 83-107.
[ bib ]
|
[CD99]
|
M. Caramia, P. Dell'Olmo (1999).
A Fast and Simple Local Search for Graph Coloring.
In J. S. Vitter, C. D. Zaroliagis (eds.),
Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK,
July 19-21, 1999, Proceedings, vol. 1668 of Lecture Notes in Computer
Science, pp. 316-329. Springer Verlag, Berlin, Germany.
[ bib ]
|
[GPR96]
|
F. Glover, M. Parker, J. Ryan (1996).
Coloring by Tabu Branch and Bound.
vol. 26 of DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, pp. 285-307. American Mathematical Society,
Providence, RI, USA.
[ bib ]
|
[RA96]
|
C. P. Ravikumar, R. Aggarwal (1996).
Parallel search-and-learn techniques and graph coloring.
Knowledge-Based Systems, vol. 9, no. 1, pp. 3 - 13.
[ bib |
DOI |
http ]
|