ArticleApplied network science2021
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks.
Riccardo Dondi et al.PubMed ↗Full text ↗Publisher ↗
No numbers read from the abstract.
4 papers cite it
this papercites it