Author:
Costa Daniel,Hertz Alain,Dubuis Clivier
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software
Reference40 articles.
1. Berge, C. (1989). Minimax relations for the partialq-colorings of a graph.Discrete Mathematics, 74, 3–14.
2. Bollobas, B. (1985).Random Graphs. New York: Academic Press.
3. Brélaz, D. (1979). New methods to color vertices of a graph.Communications of the ACM, 22, 251–256.
4. Carter, B., and Park, K. (1993). How good are genetic algorithms at finding large cliques? An experimental study. Technical Report BU-CS-93-015, Boston University.
5. Chams, M., Hertz, A., and de Werra, D. (1987). Some experiments with simulated annealing for coloring graphs.European Journal of Operational Research, 32, 260–266.
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献