The reverse greedy method ranks nodes by connectivity importance via iterative selection of nodes that keep the largest component smallest in induced subgraphs, outperforming state-of-the-art methods on ten real networks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.soc-ph 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Identifying vital nodes based on reverse greedy method
The reverse greedy method ranks nodes by connectivity importance via iterative selection of nodes that keep the largest component smallest in induced subgraphs, outperforming state-of-the-art methods on ten real networks.