Loading...
Dynamic graphs, community detection, and Riemannian geometry
A community is a subset of a wider network where the members of that subset are more strongly connected to each other than they are to the rest of the network. In this paper, we consider the problem of identifying and tracking communities in graphs that change over time – dynamic community detection...
Na minha lista:
| Udgivet i: | Appl Netw Sci |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Springer International Publishing
2018
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6214282/ https://ncbi.nlm.nih.gov/pubmed/30839776 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s41109-018-0059-2 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|