Systems Engineering and Electronics ›› 2019, Vol. 41 ›› Issue (11): 2541-2549.doi: 10.3969/j.issn.1001-506X.2019.11.18

Previous Articles     Next Articles

Identifying key nodes and edges of complex networks based on the minimum connected dominating set

LI Jiawei1,2, WU Minggong1,2, WEN Xiangxi1, LIU Fei2   

  1. 1. Air Traffic Control and Navigation College, Air Force Engineering University, Xi’an 710051, China;
    2. National Key Laboratory of Air Traffic Collision Prevention, Xi’an 710051, China
  • Online:2019-10-30 Published:2019-11-05

Abstract: The key nodes and vital edges play an important role in complex networks. Current identification methods often cannot identify these at the same time, and the angle of identification indicators is relatively single. To solve these problems, a method for identifying key nodes and connected edges of complex networks based on the minimum connected dominant set is proposed. By using the immune particle swarm optimization algorithm to find the minimum connected dominant set of networks, the core backbone network is constructed to achieve simultaneous identification of key nodes and edges of complex networks. In the process of solving the immune particle swarm optimization algorithm, the immune mechanism is introduced to guide the search direction of particle nodes, accelerate the convergence speed of the algorithm, and optimize the search node quality. The experimental results show that the proposed method can effectively identify the key nodes and edges in the complex network.

Key words: minimum connected dominating set, complex network, key nodes, vital edges

[an error occurred while processing this directive]