Author:
Balasundaram Balabhaskar,Pajouh Foad Mahdavi
Reference154 articles.
1. J. Abello, P.M. Pardalos, M.G.C. Resende, On maximum clique problems in very large graphs, in External Memory Algorithms and Visualization, ed. by J. Abello, J. Vitter, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50 (American Mathematical Society, Providence, 1999), pp. 119–130
2. J. Abello, M.G.C. Resende, S. Sudarsky, Massive quasi-clique detection, in LATIN 2002: Proceedings of the 5th Latin American Symposium on Theoretical Informatics, ed. by S. Rajsbaum (Springer, London, 2002), pp. 598–612
3. R.D. Alba, A graph-theoretic definition of a sociometric clique. J. Math. Sociol. 3(1), 113–126 (1973)
4. M.T. Almeida, F.D. Carvalho, The k-club problem: new results for k = 3. Technical report CIO working paper 3/2008, CIO-Centro de Investigação Operacional, 2008
5. M.T. Almeida, F.D. Carvalho, Integer models and upper bounds for the 3-club problem. Networks 60(3), 155–166 (2012)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献