Critical node detection problem for complex network in undirected weighted networks

DOI10.1016/j.physa.2019.122862OpenAlexW2974929433WikidataQ127200616 ScholiaQ127200616MaRDI QIDQ2164641

Manrui Jiang, Wei Chen, Jun Zhang, Cheng Jiang

Publication date: 15 August 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2019.122862

zbMATH Keywords

greedy algorithmweighted networkmixed-integer quadratic programmingcritical nodes problemnetwork fragmentation

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identifying sets of key players in a social network
• Hybrid constructive heuristics for the critical node problem
• Component-cardinality-constrained critical node problem in graphs
• An integer programming framework for critical elements detection in graphs
• Parameterized graph separation problems
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Detecting critical nodes in sparse graphs
• An optimal approach for the critical node problem using semidefinite programming
• Efficient heuristic algorithm for identifying critical nodes in planar networks
• The critical node detection problem in networks: a survey
• Efficiency of scale-free networks: Error and attack tolerance
• On the optimal vertex-connectivity augmentation
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Chaos game representation of protein sequences based on the detailed HP model and their multifractal and correlation analyses
• Propagation of computer virus both across the Internet and external computers: a complex-network approach
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Exact identification of critical nodes in sparse networks via new compact formulations
• A Region Growing Algorithm for Detecting Critical Nodes
• A Fast Greedy Algorithm for the Critical Node Detection Problem
• How to Cut a Graph into Many Pieces
• Finding k Cuts within Twice the Optimal
• On the Hamming distance of linear codes over a finite chain ring
• 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
• Increasing the Weight of Minimum Spanning Trees
• Selected Topics in Critical Element Detection
• Disconnecting graphs by removing vertices: a polyhedral approach

This page was built for publication: Critical node detection problem for complex network in undirected weighted networks