Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Wenqing, Chen, Xin, Xie, Haoxuan, Wang, Sibo, Luo, Siqiang
Format:	Preprint
Published:	2025
Subjects:	Social and Information Networks Databases Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2503.20299