IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v38y2021i01ns0217595920500414.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Xiucui Guan & Chao Liu & Qiao Zhang, 2021. "The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 38(01), pages 1-27, February.
    • Handle: RePEc:wsi:apjorx:v:38:y:2021:i:01:n:s0217595920500414
    DOI: 10.1142/S0217595920500414
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595920500414
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595920500414?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:38:y:2021:i:01:n:s0217595920500414. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.