Semi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment
RAIRO-Oper. Res., 35 2 (2001) 211-228
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic
Liat Ein-Dor and Rémi MonassonJournal of Physics A: Mathematical and General 36 (43) 11055 (2003)
https://doi.org/10.1088/0305-4470/36/43/027