Cardinality-Constrained Critical Node Detection Problem
From MaRDI portal
Publication:2997791
DOI10.1007/978-1-4419-0534-5_4zbMATH Open1213.90078OpenAlexW115487673MaRDI QIDQ2997791FDOQ2997791
Authors: Ashwin Arulselvan, Clayton W. Commander, O. V. Shylo, Panos M. Pardalos 
Publication date: 9 May 2011
Published in: Performance Models and Risk Management in Communications Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-0534-5_4
Cited In (15)
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Efficient methods for the distance-based critical node detection problem in complex networks
- Component-cardinality-constrained critical node problem in graphs
- A genetic algorithm for a class of critical node problems
- An integer programming framework for critical elements detection in graphs
- Optimal detection of critical nodes: improvements to model structure and performance
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Robust critical node selection by Benders decomposition
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- 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
- The connected critical node problem
- The critical node detection problem in networks: a survey
- Minimum vertex cover problem for coupled interdependent networks with cascading failures
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)
