The critical node detection problem in networks: A survey

M Lalou, MA Tahraoui, H Kheddouci - Computer Science Review, 2018 - Elsevier
In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …

Road network performance: A review on relevant concepts

D Rivera-Royero, G Galindo, M Jaller… - Computers & Industrial …, 2022 - Elsevier
The proper functioning of road networks is fundamental for an adequate development of
daily socio-economic activities and for the sustainability of modern communities. Road …

Detecting critical nodes in interdependent power networks for vulnerability assessment

DT Nguyen, Y Shen, MT Thai - IEEE Transactions on Smart …, 2013 - ieeexplore.ieee.org
Power networks and information systems become more and more interdependent to ensure
better supports for the functionality as well as improve the economy. However, power …

The resilience of WDM networks to probabilistic geographical failures

PK Agarwal, A Efrat, SK Ganjugunte… - IEEE/ACM …, 2013 - ieeexplore.ieee.org
Telecommunications networks, and in particular optical WDM networks, are vulnerable to
large-scale failures in their physical infrastructure, resulting from physical attacks (such as …

Power grid vulnerability to geographically correlated failures—Analysis and control implications

A Bernstein, D Bienstock, D Hay… - … -IEEE conference on …, 2014 - ieeexplore.ieee.org
We consider line outages in the transmission network of the power grid, and specifically
those caused by natural disasters or large-scale physical attacks. In such networks, an …

Disaster survivability in optical communication networks

MF Habib, M Tornatore, F Dikbiyik… - Computer …, 2013 - Elsevier
With the frequent occurrences of natural disasters damaging large portions of
communication networks and the rising risk of intentional attacks, network vulnerability to …

[HTML][HTML] Exact interdiction models and algorithms for disconnecting networks via node deletions

S Shen, JC Smith, R Goli - Discrete Optimization, 2012 - Elsevier
This paper analyzes the problem of maximizing the disconnectivity of undirected graphs by
deleting a subset of their nodes. We consider three metrics that measure the connectivity of …

Branch and cut algorithms for detecting critical nodes in undirected graphs

M Di Summa, A Grosso, M Locatelli - Computational Optimization and …, 2012 - Springer
In this paper we deal with the critical node problem, where a given number of nodes has to
be removed from an undirected graph in order to maximize the disconnections between the …

An integer programming framework for critical elements detection in graphs

A Veremyev, OA Prokopyev, EL Pasiliao - Journal of Combinatorial …, 2014 - Springer
This study presents an integer programming framework for minimizing the connectivity and
cohesiveness properties of a given graph by removing nodes and edges subject to a joint …

Exact identification of critical nodes in sparse networks via new compact formulations

A Veremyev, V Boginski, EL Pasiliao - Optimization Letters, 2014 - Springer
Critical node detection problems aim to optimally delete a subset of nodes in order to
optimize or restrict a certain metric of network fragmentation. In this paper, we consider two …