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 …
A survey of strategies for communication networks to protect against large-scale natural disasters
Recent natural disasters have revealed that emergency networks presently cannot
disseminate the necessary disaster information, making it difficult to deploy and coordinate …
disseminate the necessary disaster information, making it difficult to deploy and coordinate …
Distance-generalized core decomposition
The k-core of a graph is defined as the maximal subgraph in which every vertex is
connected to at least k other vertices within that subgraph. In this work we introduce a …
connected to at least k other vertices within that subgraph. In this work we introduce 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 …
Water‐controlled ecosystems as complex networks: Evaluation of network‐based approaches to quantify patterns of connectivity
This study provides a new perspective on understanding the intricacies of water‐mediated
connectivity in ecosystems, bridging landscape ecology and geomorphology through …
connectivity in ecosystems, bridging landscape ecology and geomorphology through …
Detecting k-Vertex Cuts in Sparse Networks via a Fast Local Search Approach
The-vertex cut (-VC) problem belongs to the family of the critical node detection problems,
which aims to find a minimum subset of vertices whose removal decomposes a graph into at …
which aims to find a minimum subset of vertices whose removal decomposes a graph into at …
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 …
Optimizing network attacks by artificial bee colony
Over the past few years, the task of conceiving effective attacks to complex networks has
arisen as an optimization problem. Attacks are modelled as the process of removing a …
arisen as an optimization problem. Attacks are modelled as the process of removing a …
Efficient methods for the distance-based critical node detection problem in complex networks
An important problem in network survivability assessment is the identification of critical
nodes. The distance-based critical node detection problem addresses the issues of internal …
nodes. The distance-based critical node detection problem addresses the issues of internal …