Compact models for critical node detection in telecommunication networks

DOI10.1016/j.endm.2018.02.007zbMath1392.90047OpenAlexW2792435571WikidataQ125725251 ScholiaQ125725251MaRDI QIDQ1742251

Xianqiang Yang

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.02.007

zbMATH Keywords

optimizationmixed integer linear programmingtelecommunication networkscritical node detectionnetwork vulnerability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Communication networks in operations research (90B18) Linear programming (90C05)

Related Items (7)

The minimum cost network upgrade problem with maximum robustness to multiple node failures ⋮ Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes ⋮ Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks ⋮ 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 ⋮ Critical nodes in interdependent networks with deterministic and probabilistic cascading failures ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem

Cites Work

• Unnamed Item
• Detecting critical nodes in sparse graphs
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• 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