Cargando…
I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive Temporal Networks
Temporal networks are an effective way to encode temporal information into graph data losslessly. Finding the bursting cohesive subgraph (BCS), which accumulates its cohesiveness at the fastest rate, is an important problem in temporal networks. The BCS has a large number of applications, such as re...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Nature Singapore
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9797886/ https://www.ncbi.nlm.nih.gov/pubmed/36594008 http://dx.doi.org/10.1007/s11390-022-2367-3 |