Cardinality-Constrained Critical Node Detection Problem
From MaRDI portal
Publication:2997791
Cited in
(15)- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- An integer programming framework for critical elements detection in graphs
- The critical node detection problem in networks: a survey
- Optimal detection of critical nodes: improvements to model structure and performance
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- Efficient methods for the distance-based critical node detection problem in complex networks
- Component-cardinality-constrained critical node problem in graphs
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- A genetic algorithm for a class of critical node problems
- Robust critical node selection by Benders decomposition
- 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
- Minimum vertex cover problem for coupled interdependent networks with cascading failures
- The connected critical node problem
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
This page was built for publication: Cardinality-Constrained Critical Node Detection Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997791)