Author:
Jin Yan,Drake John H.,He Kun,Benlic Una
Funder
National Natural Science Foundation of China
Reference39 articles.
1. The maximum clique problem;Bomze,1999
2. Reducibility among combinatorial problems;Karp,1972
3. A fast algorithm to compute maximum k-plexes in social network analysis;Xiao,2017
4. Clique relaxations in social network analysis: The maximum k-plex problem;Balasundaram;Oper. Res.,2011
5. A graph-theoretic generalization of the clique concept;Seidman;J. Math. Sociol.,1978
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献