New incremental and batch algorithms for updating k-truss decompositions under edge insertions, with large speedups on sparse graphs.
Extracting communities from complex networks by the k-dense method,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.SI 1years
2019 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Streaming and Batch Algorithms for Truss Decomposition
New incremental and batch algorithms for updating k-truss decompositions under edge insertions, with large speedups on sparse graphs.