Article PDF
Avoid common mistakes on your manuscript.
References
Zheng X Q, Liu T G, Yang Z N, et al. Large cliques in Arabidopsis gene coexpression network and motif discovery. J Plant Physiol, 2011, 168: 611–618
Conrad L, Aaron M, Fergal R, et al. Detecting highly overlapping community structure by greedy clique expansion. In: Proceedings the 4th SNA-KDD Workshop on Social Network Mining and Analysis, Washington, 2010. 112–119
Krause A, Guestrin C. Near-optimal observation selection using submodular functions. In: Proceedings AAAI Conference on Artificial Intelligence, Canada, 2007. 22–26
Berry N M, Ko T H, Moy T, et al. Emergent clique formation in terrorist recruitment. In: Proceedings the AAAI Workshop on Agent Organizations: Theory and Practice, Menlo Park, 2004
Feige U. A threshold of ln n for approximating set cover. J ACM, 1998, 45: 634–652
Yuan L, Qin L, Lin X M, et al. Diversified top-k clique search. VLDB J, 2016, 25: 171–196
Li C M, Manyà F, Quan Z, et al. Exact MinSAT solving. In: Proceedings the 13th International Conference on Theory and Applications of Satisfiability Testing, Edinburgh, 2010. 363–368
Alexey I, Morgado A, Marques-Silva J. RC2: an efficient MaxSAT solver. J Satisfiability Boolean Modeling Comput, 2019, 11: 53–64
Fahiem B, Matti J, Ruben M. MaxSAT Evaluation 2019: Solver and Benchmark Descriptions. Department of Computer Science Report Series B-2019-2. 2019
Acknowledgements
This work was supported by National Natural Science Foundation of China (Grant Nos. 61976050, 61403076, 61806050, 61806082) and Fundamental Research Funds for the Central Universities (Grant No. 2412019FZ050).
Author information
Authors and Affiliations
Corresponding author
Supplementary File
Rights and permissions
About this article
Cite this article
Zhou, J., Li, C., Zhou, Y. et al. Solving diversified top-k weight clique search problem. Sci. China Inf. Sci. 64, 150105 (2021). https://doi.org/10.1007/s11432-020-3069-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-020-3069-4