Subject
General Engineering,General Computer Science
Reference39 articles.
1. Abello, J., Resende, M. G. C., & Sudarsky, S. (2002). Massive quasi-clique detection. In: LATIN 2002: Theoretical informatics, lecture notes in computer science (pp. pp. 598–612). Berlin, Heidelberg: Springer. doi:https://doi.org/10.1007/3-540-45995-2_51. .
2. Clique relaxations in social network analysis: The maximum k-plex problem;Balasundaram;Operations Research,2011
3. Novel approaches for analyzing biological networks;Balasundaram;Journal of Combinatorial Optimization,2005
4. Batagelj, A. M. V. (2006). Pajek datasets. Accessed: 2018-09-26. .
5. Bhattacharyya, M., & Bandyopadhyay, S. (2009). Mining the largest quasi-clique in human protein interactome. In 2009 International conference on adaptive and intelligent systems (pp. 194–199). doi:https://doi.org/10.1109/ICAIS.2009.39.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献