Optimal Quasi-clique: Hardness, Equivalence with Densest-$k$-Subgraph, and Quasi-partitioned Community Mining

0citations
0
Citations
#878
in AAAI 2024
of 2289 papers
2
Authors
1
Data Points

Citation History

Jan 28, 2026
0