Critical node detection problem for complex network in undirected weighted networks
From MaRDI portal
Publication:2164641
DOI10.1016/J.PHYSA.2019.122862OpenAlexW2974929433WikidataQ127200616 ScholiaQ127200616MaRDI QIDQ2164641FDOQ2164641
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
weighted networkgreedy algorithmmixed-integer quadratic programmingcritical nodes problemnetwork fragmentation
Cites Work
- Identifying sets of key players in a social network
- Efficiency of scale-free networks: Error and attack tolerance
- 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
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- 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
- 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
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Selected Topics in Critical Element Detection
- Title not available (Why is that?)
- On the Hamming distance of linear codes over a finite chain ring
- The critical node detection problem in networks: a survey
- Propagation of computer virus both across the Internet and external computers: a complex-network approach
- A Fast Greedy Algorithm for the Critical Node Detection Problem
- Finding k Cuts within Twice the Optimal
- Chaos game representation of protein sequences based on the detailed HP model and their multifractal and correlation analyses
- On the optimal vertex-connectivity augmentation
- How to Cut a Graph into Many Pieces
- Disconnecting graphs by removing vertices: a polyhedral approach
- Increasing the Weight of Minimum Spanning Trees
- Identification of critical nodes and links in financial networks with intermediation and electronic transactions
- Title not available (Why is that?)
- Complexity and approximability of the k‐way vertex cut
- A Region Growing Algorithm for Detecting Critical Nodes
Cited In (2)
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)
