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 …

Comparative analysis of centrality measures for identifying critical nodes in complex networks

O Ugurlu - Journal of Computational Science, 2022 - Elsevier
One of the fundamental tasks in complex networks is detecting critical nodes whose removal
significantly disrupts network connectivity. Identifying critical nodes can help analyze the …

Analyzing the critical locations in response of constructed and planned dams on the Mekong River Basin for environmental integrity

Y Gao, S Sarker, T Sarker, OT Leta - Environmental Research …, 2022 - iopscience.iop.org
Massive hydropower dams in the Mekong river basin (MRB) have triggered substantial
debate and international attention due to its utmost importance on maintaining ecology and …

Critical nodes in river networks

S Sarker, A Veremyev, V Boginski, A Singh - Scientific reports, 2019 - nature.com
River drainage networks are important landscape features that have been studied for
several decades from a range of geomorphological and hydrological perspectives …

Critical nodes for distance‐based connectivity and related problems in graphs

A Veremyev, OA Prokopyev, EL Pasiliao - Networks, 2015 - Wiley Online Library
This study considers a class of critical node detection problems that involves minimization of
a distance‐based connectivity measure of a given unweighted graph via the removal of a …

A fast tri-individual memetic search approach for the distance-based critical node problem

Y Zhou, G Wang, JK Hao, N Geng, Z Jiang - European Journal of …, 2023 - Elsevier
The distance-based critical node problem involves identifying a subset of nodes in a graph
such that the removal of these nodes leads to a residual graph with the minimum distance …

Scalable rapid framework for evaluating network worst robustness with machine learning

W Jiang, P Li, T Fan, T Li, C Zhang, T Zhang… - Reliability Engineering & …, 2024 - Elsevier
Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks,
with simulation attacks being the prevailing evaluation method. Simulation attacks are often …

Memetic search for identifying critical nodes in sparse graphs

Y Zhou, JK Hao, F Glover - IEEE transactions on cybernetics, 2018 - ieeexplore.ieee.org
Critical node problems (CNPs) involve finding a set of critical nodes from a graph whose
removal results in optimizing a predefined measure over the residual graph. As useful …

A general evolutionary framework for different classes of critical node problems

R Aringhieri, A Grosso, P Hosteins… - … Applications of Artificial …, 2016 - Elsevier
We design a flexible Evolutionary Framework for solving several classes of the Critical Node
Problem (CNP), ie the maximal fragmentation of a graph through node deletion, given a …

Sequential shortest path interdiction with incomplete information

JS Borrero, OA Prokopyev, D Sauré - Decision Analysis, 2016 - pubsonline.informs.org
We study sequential interdiction when the interdictor has incomplete initial information about
the network and the evader has complete knowledge of the network, including its structure …