The critical node detection problem in networks: A survey
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 …
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 …
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
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 …
debate and international attention due to its utmost importance on maintaining ecology and …
Critical nodes in river networks
River drainage networks are important landscape features that have been studied for
several decades from a range of geomorphological and hydrological perspectives …
several decades from a range of geomorphological and hydrological perspectives …
Critical nodes for distance‐based connectivity and related problems in graphs
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 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
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 …
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
Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks,
with simulation attacks being the prevailing evaluation method. Simulation attacks are often …
with simulation attacks being the prevailing evaluation method. Simulation attacks are often …
Memetic search for identifying critical nodes in sparse graphs
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 …
removal results in optimizing a predefined measure over the residual graph. As useful …
A general evolutionary framework for different classes of critical node problems
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 …
Problem (CNP), ie the maximal fragmentation of a graph through node deletion, given a …
Sequential shortest path interdiction with incomplete information
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 …
the network and the evader has complete knowledge of the network, including its structure …