Cardinality-Constrained Critical Node Detection Problem
From MaRDI portal
Publication:2997791
DOI10.1007/978-1-4419-0534-5_4zbMath1213.90078OpenAlexW115487673MaRDI QIDQ2997791
Clayton W. Commander, Ashwin Arulselvan, Panos M. Pardalos, Oleg V. Shylo
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
Related Items
Component-cardinality-constrained critical node problem in graphs ⋮ Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ A genetic algorithm for a class of critical node problems ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ The connected critical node problem ⋮ An integer programming framework for critical elements detection in 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 ⋮ The critical node detection problem in networks: a survey ⋮ Minimum vertex cover problem for coupled interdependent networks with cascading failures ⋮ Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem ⋮ Optimal detection of critical nodes: improvements to model structure and performance ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ Robust Critical Node Selection by Benders Decomposition ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
