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

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

The notion of k-truss has been introduced a decade ago in social network analysis and security for community detection, as a form of cohesive subgraphs less stringent than a clique (set of pairwise linked nodes), and more selective than a k-core (induced subgraph with minimum degree k). A k-truss is...

Full description

Bibliographic Details
Main Authors: Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Community detection
graph algorithms
in-memory computation
k-trusses
social network analysis
truss decomposition
Online Access:https://ieeexplore.ieee.org/document/9146824/

Internet

https://ieeexplore.ieee.org/document/9146824/

Similar Items