Cargando…
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
The use of networks for modelling and analysing relations among data is currently growing. Recently, the use of a single networks for capturing all the aspects of some complex scenarios has shown some limitations. Consequently, it has been proposed to use Dual Networks (DN), a pair of related networ...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8179714/ https://www.ncbi.nlm.nih.gov/pubmed/34124340 http://dx.doi.org/10.1007/s41109-021-00381-8 |