Compact models for critical node detection in telecommunication networks
From MaRDI portal
Recommendations
- Optimal detection of critical nodes: improvements to model structure and performance
- Exact identification of critical nodes in sparse networks via new compact formulations
- The critical node detection problem in networks: a survey
- A derandomized approximation algorithm for the critical node detection problem
- An optimal approach for the critical node problem using semidefinite programming
Cites work
Cited in
(9)- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Optimal detection of critical nodes: improvements to model structure and performance
- Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes
- The minimum cost network upgrade problem with maximum robustness to multiple node failures
- Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures
- Min–max optimization of node‐targeted attacks in service networks
- Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements
- Exact identification of critical nodes in sparse networks via new compact formulations
This page was built for publication: Compact models for critical node detection in telecommunication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742251)