Publication | Open Access

A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks