期刊
SCIENTIFIC REPORTS
卷 6, 期 -, 页码 -出版社
NATURE PUBLISHING GROUP
DOI: 10.1038/srep37954
关键词
-
资金
- National Basic Research Program of China [2013CB932804]
- National Natural Science Foundation of China [11121403, 11225526]
- Knowledge Innovation Program of Chinese Academy of Sciences [KJCX2-EW-J02]
Decycling and dismantling of complex networks are underlying many important applications in network science. Recently these two closely related problems were tackled by several heuristic algorithms, simple and considerably sub-optimal, on the one hand, and involved and accurate message-passing ones that evaluate single-node marginal probabilities, on the other hand. In this paper we propose a simple and extremely fast algorithm, CoreHD, which recursively removes nodes of the highest degree from the 2-core of the network. CoreHD performs much better than all existing simple algorithms. When applied on real-world networks, it achieves equally good solutions as those obtained by the state-of-art iterative message-passing algorithms at greatly reduced computational cost, suggesting that CoreHD should be the algorithm of choice for many practical purposes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据