Lin, W., Chen, X., Xie, H., Wang, S., & Luo, S. (2025). Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks.
Style de citation Chicago (17e éd.)Lin, Wenqing, Xin Chen, Haoxuan Xie, Sibo Wang, et Siqiang Luo. Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks. 2025.
Style de citation MLA (9e éd.)Lin, Wenqing, et al. Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks. 2025.
Attention : ces citations peuvent ne pas être correctes à 100%.