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...
Gardado en:
| Publicado en: | Appl Netw Sci |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Springer International Publishing
2021
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC8179714/ https://ncbi.nlm.nih.gov/pubmed/34124340 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s41109-021-00381-8 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|