The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees

Xiucui Guan, Chao Liu () and Qiao Zhang ()
Additional contact information
Xiucui Guan: School of Mathematics, Southeast University, Jiangning District, Nanjing 210096, P. R. China
Chao Liu: School of Mathematics, Southeast University, Jiangning District, Nanjing 210096, P. R. China
Qiao Zhang: School of Mathematics, Southeast University, Jiangning District, Nanjing 210096, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2021, vol. 38, issue 01, 1-27

Abstract: We deal with the critical node problem (CNP) in a graph G, in which a given number K of nodes are removed to minimize the connectivity of the residual graph in some sense. Several ways to minimize some connectivity measurement have been proposed, including minimizing the connectivity index(MinCI), maximizing the number of components, minimizing the maximal component size. We propose two classes of CNPs by combining the above measurements together. The objective is to minimize the sum of connectivity indexes and the total degrees in the residual graph. The CNP with an upper-bound M on the maximal component size is denoted by MSCID-CS and the one with an extra upper-bound P on the number of components is denoted by MSCID-CSN. They are generalizations of the MinCI, which has been shown NP-hard for general graphs. In particular, we study the case where G is a tree. Two dynamic programming algorithms are proposed to solve the two classes of CNPs. The time complexities of the algorithms for MSCID-CS and MSCID-CSN are O(n2K2M2) and O(n2K2M2P2), respectively, where n is the number of nodes in G. Computational experiments are presented which show the effectiveness of the algorithms.

Keywords: Critical node problem; tree; dynamic programming; connectivity index (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595920500414
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:38:y:2021:i:01:n:s0217595920500414

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595920500414

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().