Top-k Densest Subgraphs Search in Temporal Graphs
The dense subgraph search problem is one of the most important graph analysis problems.It is widely used in many fields,such as the social user correlation analysis in social networks,the community discovery in the Web,etc.However,the current research focuses on searching dense subgraphs on static g...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Chinês |
| Publicat: |
Editorial office of Computer Science
2021-10-01
|
| Col·lecció: | Jisuanji kexue |
| Matèries: | |
| Accés en línia: | http://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2021-10-152.pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|