A heuristic approach for the distance-based critical node detection problem in complex networks

• Published in: The Journal of the Operational Research Society Vol. 73; no. 6; pp. 1347 - 1361
• Main Authors: Alozie, Glory Uche, Arulselvan, Ashwin, Akartunalı, Kerem, Pasiliao, Eduardo L.
• Format: Journal Article
• Language: English
• Published: Taylor & Francis 03.06.2022
• Subjects: breadth first search; centrality; Distance-based critical node problem; heuristics; hop distance

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 classical critical node problem as a special case, the distance-based critical node problem is computationally challengin...