Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles IEEE Access Year : 2020

Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
Truly_Scalable_K-Truss_and_Max-Truss_Algorithms_fo.pdf (441.51 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Marie-France Sagot  : Connect in order to contact the contributor

https://inria.hal.science/hal-02956066

Submitted on : Friday, October 2, 2020-1:03:34 PM

Last modification on : Friday, December 20, 2024-11:38:18 AM

Long-term archiving on : Monday, January 4, 2021-8:48:58 AM

Download

Dates and versions

hal-02956066 , version 1 (02-10-2020)

Identifiers

Cite

Alessio Conte, Daniele de Sensi, Roberto Grossi, Andrea Marino, Luca Versari. Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access, 2020, 8, pp.139096-139109. ⟨10.1109/ACCESS.2020.3011667⟩. ⟨hal-02956066⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INRIA INRIA2
35 View
280 Download

Altmetric

Share

More