Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Applied Mathematics,Artificial Intelligence,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Information Systems
Reference47 articles.
1. Garey MR, Johnson DS (1979) Computers and Interactability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco
2. Tommy RJ, Bjarne T (1995) Graph Coloring Problems. Wiley, New York
3. Noise Reduction in VLSI Circuits using Modified GA Based Graph Coloring (2010) Int J Control Autom 3:2.
4. Hertz A, Werra DE (1987) Using tabu search techniques for graph coloring. Computing 39(4):345–351
5. Fleurent C, Ferland JA (1995) Genetic and hybrid algorithms for graph coloring. Ann Oper Res 63:437–463
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献