Crossmark

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

Published Online: 2021-06-05

Published Print: 2021-12

Authors

Dondi, Riccardo

Hosseinzadeh, Mohammad Mehdi

Guzzi, Pietro H. http://orcid.org/0000-0001-5542-2997
Funding

Funding for this research was provided by:

MIUR (PON-VQA)
License Information

Text and Data Mining valid from 2021-06-05

Version of Record valid from 2021-06-05
More Information

Article History

Received: 26 February 2021

Accepted: 20 May 2021

First Online: 5 June 2021

Declarations

:

: The authors declare that they have no competing interests.

: We give our consent for the publication.

Document is current