LEKS, a tree-based local expansion algorithm, finds smaller-weight intimate-core groups in weighted graphs faster than the existing ICG-M heuristic on three real networks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast Algorithms for Intimate-Core Group Search in Weighted Graphs
LEKS, a tree-based local expansion algorithm, finds smaller-weight intimate-core groups in weighted graphs faster than the existing ICG-M heuristic on three real networks.