A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
Abstract 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 relat...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
SpringerOpen
2021-06-01
|
| Colección: | Applied Network Science |
| Materias: | |
| Acceso en línea: | https://doi.org/10.1007/s41109-021-00381-8 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|