Critical node detection problem for complex network in undirected weighted networks
type: Item
instance of: scholarly article
title: Critical node detection problem for complex network in undirected weighted networks
author: Wei Chen
author: Manrui Jiang
author: Cheng Jiang
author: Jun Zhang
published in: Physica A
publication date: 2022-08-15T00:00:00Z
Mathematics Subject Classification ID: 82-XX
zbMATH DE Number: 7571881
zbMATH Keywords: critical nodes problem
zbMATH Keywords: weighted network
zbMATH Keywords: network fragmentation
zbMATH Keywords: mixed-integer quadratic programming
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
full work available at URL: j.physa.2019.122862
OpenAlex ID: W2974929433
cites work: Identifying sets of key players in a social network
cites work: Propagation of computer virus both across the Internet and external computers: a complex-network approach
cites work: Q3524423
cites work: Component-cardinality-constrained critical node problem in graphs
cites work: Efficiency of scale-free networks: Error and attack tolerance
cites work: Increasing the Weight of Minimum Spanning Trees
cites work: Finding k Cuts within Twice the Optimal
cites work: Q4228452
cites work: On the optimal vertex-connectivity augmentation
cites work: Parameterized graph separation problems
cites work: How to Cut a Graph into Many Pieces
cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions
cites work: Complexity and approximability of the k‐way vertex cut
cites work: Disconnecting graphs by removing vertices: a polyhedral approach
cites work: Selected Topics in Critical Element Detection
cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
cites work: A Fast Greedy Algorithm for the Critical Node Detection Problem
cites work: Detecting critical nodes in sparse graphs
cites work: Branch and cut algorithms for detecting critical nodes in undirected graphs
cites work: Exact identification of critical nodes in sparse networks via new compact formulations
cites work: An integer programming framework for critical elements detection in graphs
cites work: A Region Growing Algorithm for Detecting Critical Nodes
cites work: Hybrid constructive heuristics for the critical node problem
cites work: An optimal approach for the critical node problem using semidefinite programming
cites work: Efficient heuristic algorithm for identifying critical nodes in planar networks
cites work: The critical node detection problem in networks: a survey
cites work: Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
cites work: Chaos game representation of protein sequences based on the detailed HP model and their multifractal and correlation analyses
cites work: On the Hamming distance of linear codes over a finite chain ring
cites work: Q3140399
Wikidata QID: Q127200616
DOI: 10.1016/J.PHYSA.2019.122862
description: scientific article