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...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
IEEE
2020-01-01
|
| Schriftenreihe: | IEEE Access |
| Schlagworte: | |
| Online-Zugang: | https://ieeexplore.ieee.org/document/9146824/ |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|