摘要
<jats:title>Abstract</jats:title><jats:p>The identification of vital nodes that maintain the network connectivity is a long-standing challenge in network science. In this paper, we propose a so-called reverse greedy method where the least important nodes are preferentially chosen to make the size of the largest component in the corresponding induced subgraph as small as possible. Accordingly, the nodes being chosen later are more important in maintaining the connectivity. Empirical analyses on eighteen real networks show that the reverse greedy method performs remarkably better than well-known state-of-the-art methods.</jats:p>
- 复杂网络上节点重要度的确定方法张斌武; 邹森; 王勤兰州理工大学学报, 2013, (03): 85-87.
- Complex scheduling network: an objective performance testing platform for evaluating vital nodes identification algorithmsZhuang, Zilong; Chen, Yu; Sun, Yanning; Qin, Wei*INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2020, 111(1-2): 273-282.被引 6
- Important edge identification in complex networks based on local and global featuresSong, Jia-Hui*Chinese Physics B, 2023, 32(9): 098901.被引 2
