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

DOI10.1142/S0217595920500414zbMath1481.90275OpenAlexW3048608145MaRDI QIDQ5012889

Qiao Zhang, Chao Liu, Xiucui Guan

Publication date: 26 November 2021

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595920500414

zbMATH Keywords

treedynamic programmingcritical node problemconnectivity index

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Identifying sets of key players in a social network
• Component-cardinality-constrained critical node problem in graphs
• An integer programming framework for critical elements detection in graphs
• Complexity of the critical node problem over trees
• Detecting critical nodes in sparse graphs
• The bi-objective critical node detection problem
• The critical node detection problem in networks: a survey
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Epidemic dynamics on complex networks
• Detecting critical node structures on graphs: A mathematical programming approach
• Complexity and approximability of the k‐way vertex cut
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs

This page was built for publication: The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees