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 …
others. The issue of finding the most important nodes in networks has been addressed …
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 …
Efficient benders decomposition for distance-based critical node detection problem
F Hooshmand, F Mirarabrazi, SA MirHassani - Omega, 2020 - Elsevier
This paper addresses the critical node detection problem which seeks a subset of nodes for
removal in order to maximize the disconnectivity of the residual graph with respect to a …
removal in order to maximize the disconnectivity of the residual graph with respect to a …
A heuristic approach for the distance-based critical node detection problem in complex networks
The distance-based critical node problem involves identifying a subset of nodes in a network
whose removal minimises a pre-defined distance-based connectivity measure. Having the …
whose removal minimises a pre-defined distance-based connectivity measure. Having the …
[HTML][HTML] Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
R Aringhieri, A Grosso, P Hosteins… - Discrete Applied …, 2019 - Elsevier
Abstract We study the Distance Critical Node Problem, a generalisation of the Critical Node
Problem where the distances between node pairs impact on the objective function. We …
Problem where the distances between node pairs impact on the objective function. We …
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
M Lalou, H Kheddouci - Optimization Letters, 2019 - Springer
In this paper, we propose a polynomial-time algorithm for solving the Component-Cardinality-
Constrained Critical Node Problem (3C-CNP) on bipartite permutation graphs. This problem …
Constrained Critical Node Problem (3C-CNP) on bipartite permutation graphs. This problem …
[PDF][PDF] Computer Science Review
M Lalou, MA Tahraoui, H Kheddouci - 2018 - academia.edu
abstract 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 …
than others. The issue of finding the most important nodes in networks has been addressed …