A derandomized approximation algorithm for the critical node detection problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7059791
- A fast greedy algorithm for the critical node detection problem
- The critical node detection problem in networks: a survey
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Approximation algorithm for \(k\)-node connected subgraphs via critical graphs
- Efficient methods for the distance-based critical node detection problem in complex networks
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- The bi-objective critical node detection problem
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- Approximate max-flow min-(multi)cut theorems and their applications
- 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
- Cut Problems in Graphs with a Budget Constraint
- Detecting critical nodes in sparse graphs
- Emergence of Scaling in Random Networks
- Expander flows, geometric embeddings and graph partitioning
- Expander flows, geometric embeddings and graph partitioning
- Finding k Cuts within Twice the Optimal
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- How the science of complex networks can help developing strategies against terrorism
- 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
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- The complexity and approximability of minimum contamination problems
Cited in
(30)- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Detecting critical node structures on graphs: a mathematical programming approach
- Hybrid constructive heuristics for the critical node problem
- A genetic algorithm for a class of critical node problems
- A novel method of evaluating key nodes in complex networks
- An integer programming framework for critical elements detection in graphs
- On dynamic network security: a random decentering algorithm on graphs
- Generalized network dismantling
- Compact models for critical node detection in telecommunication networks
- Complexity of the multilevel critical node problem
- Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks
- Methods for removing links in a network to minimize the spread of infections
- A region growing algorithm for detecting critical nodes
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
- Computing critical nodes in directed graphs
- An optimal approach for the critical node problem using semidefinite programming
- Robust critical node selection by Benders decomposition
- Efficient heuristic algorithm for identifying critical nodes in planar networks
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Selected topics in critical element detection
- Bound and exact methods for assessing link vulnerability in complex networks
- Literature review: the vaccine supply chain
- A randomized algorithm with local search for containment of pandemic disease spread
- scientific article; zbMATH DE number 7059791 (Why is no real title available?)
- The bi-objective critical node detection problem
- The critical node detection problem in networks: a survey
- A fast greedy algorithm for the critical node detection problem
- Parameterized complexity of critical node cuts
- Parameterized and approximation complexity of the detection pair problem in graphs
This page was built for publication: A derandomized approximation 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 Q336925)
