The network dismantling problem is one of the most fundamental problems in network science. It aims to identify the minimum number of nodes, such that after their removal the network is broken into many disconnected pieces with a sub-extensive size. However, the identification of the minimum removed nodes belongs to the class of nondeterministic polynomial problems. Although many heuristic algorithms have been proposed to identify the removed nodes, the smallest dismantling set remains unknown. Therefore, the determination of a good lower bound of dismantling sets is of great significance to evaluating the performances of heuristic algorithms. The minimum number of deleted nodes to dismantle a network is strictly no smaller than that to dismantle its any subnetwork in nature. Any lower bound of a subnetwork is indeed a lower bound of the original network. Utilizing the heterogeneous degree distribution and 2-core properties, we find that with previous removal of some appropriate nodes, the lower bound obtained on the basis of the subnetwork is counterintuitively significantly better than the one obtained directly on the original network, especially for the real-world networks.
Skip Nav Destination
Article navigation
June 2018
Research Article|
June 29 2018
Lower bound of network dismantling problem
Jiachen Sun;
Jiachen Sun
1
School of Electronics and Information Technology, Sun Yat-sen University
, Guangzhou 510006, China
Search for other works by this author on:
Rong Liu;
Rong Liu
2
School of Data and Computer Science, Sun Yat-sen University
, Guangzhou 510006, China
Search for other works by this author on:
Zhengping Fan;
Zhengping Fan
2
School of Data and Computer Science, Sun Yat-sen University
, Guangzhou 510006, China
Search for other works by this author on:
Jiarong Xie;
Jiarong Xie
2
School of Data and Computer Science, Sun Yat-sen University
, Guangzhou 510006, China
Search for other works by this author on:
Xiao Ma;
Xiao Ma
2
School of Data and Computer Science, Sun Yat-sen University
, Guangzhou 510006, China
Search for other works by this author on:
Yanqing Hu
Yanqing Hu
a)
2
School of Data and Computer Science, Sun Yat-sen University
, Guangzhou 510006, China
Search for other works by this author on:
a)
Electronic mail: huyanq@mail.sysu.edu.cn
Chaos 28, 063128 (2018)
Article history
Received:
January 31 2018
Accepted:
June 06 2018
Citation
Jiachen Sun, Rong Liu, Zhengping Fan, Jiarong Xie, Xiao Ma, Yanqing Hu; Lower bound of network dismantling problem. Chaos 1 June 2018; 28 (6): 063128. https://doi.org/10.1063/1.5024338
Download citation file:
Sign in
Don't already have an account? Register
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Sign in via your Institution
Sign in via your InstitutionPay-Per-View Access
$40.00
Citing articles via
Related Content
Physicochemical characterisation of seawater at area of ship dismantling activities
AIP Conference Proceedings (December 2019)
Chicago betatron dismantled
Physics Today (March 1965)
Dismantling complex networks based on the principal eigenvalue of the adjacency matrix
Chaos (August 2020)
The results of the technical inspection of the production building on Buika street, house 24 in the City of Lviv
AIP Conf. Proc. (August 2023)