From: A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
Semantic similarity
Random solutions
\(0.3 \pm 0.1\)
DCS
\(0.6 \pm 0.1\)