"Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World ..."

Xin Chen et al. (2025)

> Home

Details and statistics

DOI: 10.1109/ICDE65448.2025.00248

access: closed

type: Conference or Workshop Paper

metadata version: 2025-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icde/ChenLXWL25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icde/ChenLXWL25
Xin Chen, Wenqing Lin, Haoxuan Xie, Sibo Wang, Siqiang Luo:
Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks. ICDE 2025: 3316-3328

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.