As an effective way to defend against network failure, nodes or links in a network can be
protected to ensure connectivity. The consolidation of critical nodes is a necessary strategy …

As one realistic way to improve the robustness of network, the protection of critical links will
help build resilient link structure to defend against random link failure, especially in sparse …

Random failure is a common threat to a network, where the failure of a few edges can
disconnect a large-scale sparse network. To enhance the robustness of network, the …

Many real-world applications can be modelled as complex networks, and such networks
include the Internet, epidemic disease networks, transport networks, power grids, protein …

We present two metaheuristics for the Critical Node Problem, that is, the maximal
fragmentation of a graph through the deletion of nodes. The two metaheuristics are based …

In designing reliable and impermeable networks, the robustness of the network is evaluated
against the removal and failure of the node or edge where the network robustness (network …

Nearly all real-world networks are complex networks and usually are in danger of collapse.
Therefore, it is crucial to exploit and understand the mechanisms of network attacks and …

The objective of critical nodes problem is to minimize pair-wise connectivity as a result of
removing a specific number of nodes in the residual graph. From a mathematical modeling …

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 …

We examine variants of the critical node problem on specially structured graphs, which aim
to identify a subset of nodes whose removal will maximally disconnect the graph. These …