Author:
Pattillo Jeffrey,Youssef Nataly,Butenko Sergiy
Reference85 articles.
1. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley & Sons Incorporated, Chichester, UK, 1989.
2. J. Abello, P.M. Pardalos, and M.G.C. Resende. On maximum clique problems in very large graphs. In J. Abello and J. Vitter, editors, External memory algorithms and visualization, volume 50 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 119–130. American Mathematical Society, 1999.
3. J. Abello, M.G.C. Resende, and S. Sudarsky. Massive quasi-clique detection. In S. Rajsbaum, editor, LATIN 2002: Theoretical Informatics, pages 598–612, London, 2002. Springer-Verlag.
4. R.D. Alba. A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology, 3:113–126, 1973.
5. D. Applegate and D.S. Johnson. dfmax.c [c program, second dimacs implementation challenge]. ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/ .
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献