Author:
Iovanella Antonio,Scoppola Benedetto,Scoppola Elisabetta
Publisher
Springer Science and Business Media LLC
Subject
Mathematical Physics,Statistical and Nonlinear Physics
Reference15 articles.
1. R. Battiti and M. Protasi, Reactive Local Search for the Maximum Clique Problem. Algorithmica 29:610–637 (2001).
2. B. Bollobas, Random Graph (2nd edn.). (Cambridge University Press, 2001).
3. M. Caramia and G. Felici, Mining relevant information on the Web: a clique based approach, International Journal of Production Research, special issue on Data Mining, accepted 2006.
4. P. Dankelmanna, G. S. Domkeb, W. Goddardc, P. Groblerd, J. H. Hattinghb, and H. C. Swarta, Maximum sizes of graphs with given domination parameters. Discrete Math. 281:137–148 (2004).
5. M. R. Garey and D. S. Johnson, Computer and Intractability: A guide to the theory of NP-completeness. (Freeman, New York, 1976).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献