Scalable probabilistic truss decomposition using central limit theorem and H-index

Truss decomposition is a popular notion of hierarchical dense substructures in graphs. In a nutshell, k-truss is the largest subgraph in which every edge is contained in at least k triangles. Truss decomposition aims to compute k-trusses for each possible value of k. There are many works that study...

Descripción completa

Detalles Bibliográficos
Autores principales: Esfahani, Fatemeh, Daneshmand, Mahsa, Srinivasan, Venkatesh, Thomo, Alex, Wu, Kui
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9310023/
https://www.ncbi.nlm.nih.gov/pubmed/35911177
http://dx.doi.org/10.1007/s10619-022-07415-9

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9310023/
https://www.ncbi.nlm.nih.gov/pubmed/35911177
http://dx.doi.org/10.1007/s10619-022-07415-9

Ejemplares similares