Report - Clustering and community detection · Comment: Finding dense subgraphs is hard in general • Finding largest clique – NP-hard – Computationally intractable • Decision version:

Please pass captcha verification before submit form