Critical node detection problem for complex network in undirected weighted networks

DOI10.1016/J.PHYSA.2019.122862MaRDI QIDQ2164641OpenAlexWikidataFDO

Authors Wei Chen, Manrui Jiang, Cheng Jiang, Jun Zhang

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

weighted networkgreedy algorithmmixed-integer quadratic programmingcritical nodes problemnetwork fragmentation

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Recommendations

• A fast greedy algorithm for the critical node detection problem
• An optimal approach for the critical node problem using semidefinite programming
• The critical node detection problem in networks: a survey
• A derandomized approximation algorithm for the critical node detection problem
• Optimal detection of critical nodes: improvements to model structure and performance

Cites work

• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• scientific article; zbMATH DE number 1256717 (Why is no real title available?)
• A fast greedy algorithm for the critical node detection problem
• A region growing algorithm for detecting critical nodes
• An integer programming framework for critical elements detection in graphs
• An optimal approach for the critical node problem using semidefinite programming
• 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
• Complexity and approximability of the \(k\)-way vertex cut
• Component-cardinality-constrained critical node problem in graphs
• Detecting critical nodes in sparse graphs
• Disconnecting graphs by removing vertices: a polyhedral approach
• Efficiency of scale-free networks: Error and attack tolerance
• Efficient heuristic algorithm for identifying critical nodes in planar networks
• Exact identification of critical nodes in sparse networks via new compact formulations
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Finding k Cuts within Twice the Optimal
• How to Cut a Graph into Many Pieces
• Hybrid constructive heuristics for the critical node problem
• Identification of critical nodes and links in financial networks with intermediation and electronic transactions
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Identifying sets of key players in a social network
• Increasing the Weight of Minimum Spanning Trees
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• On the Hamming distance of linear codes over a finite chain ring
• On the optimal vertex-connectivity augmentation
• Parameterized graph separation problems
• Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
• Propagation of computer virus both across the Internet and external computers: a complex-network approach
• Selected topics in critical element detection
• The critical node detection problem in networks: a survey

Cited in

(2)

• Optimal detection of critical nodes: improvements to model structure and performance
• Exact identification of critical nodes in sparse networks via new compact formulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164641)