Login / Signup

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

Aritra KonarNicholas D. Sidiropoulos
Published in: AAAI (2024)
Keyphrases
  • graph mining
  • worst case
  • maximum weight
  • community mining
  • np hard
  • np complete
  • search space
  • social network analysis
  • community detection
  • graph databases
  • similarity graph