A fast greedy algorithm for the critical node detection problem
From MaRDI portal
Recommendations
Cites work
- A derandomized approximation algorithm for the critical node detection problem
- A randomized algorithm with local search for containment of pandemic disease spread
- An integer programming framework for critical elements detection in graphs
- Authoritative sources in a hyperlinked environment
- Bound and exact methods for assessing link vulnerability in complex networks
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Collective dynamics of `small-world' networks
- Complexity of the critical node problem over trees
- Depth-First Search and Linear Graph Algorithms
- Detecting critical nodes in sparse graphs
- Exact identification of critical nodes in sparse networks via new compact formulations
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Cited in
(30)- Detecting critical nodes in sparse graphs
- An optimal approach for the critical node problem using semidefinite programming
- The bi-objective critical node detection problem
- Efficient heuristic algorithm for identifying critical nodes in planar networks
- Critical node identification for complex network based on a novel minimum connected dominating set
- The critical node detection problem in networks: a survey
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Critical node detection problem for complex network in undirected weighted networks
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- VNS solutions for the critical node problem
- Efficient methods for the distance-based critical node detection problem in complex networks
- A region growing algorithm for detecting critical nodes
- Robust optimization of graph partitioning and critical node detection in analyzing networks
- Finding the most relevant fragments in networks
- A genetic algorithm for a class of critical node problems
- Method of social network dismantling based on neighbor nodes fusion
- A derandomized approximation algorithm for the critical node detection problem
- Efficient network dismantling via node explosive percolation
- An integer programming framework for critical elements detection in graphs
- Detecting critical node structures on graphs: a mathematical programming approach
- V-E algorithm: a new vital vertex identifying algorithm based on vertex-edge interaction
- Dismantling complex networks based on the principal eigenvalue of the adjacency matrix
- Computing critical nodes in directed graphs
- Selected topics in critical element detection
- scientific article; zbMATH DE number 7059791 (Why is no real title available?)
- Critical node/edge detection problems on trees
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search
This page was built for publication: A fast greedy algorithm for the critical node detection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942435)
