Graph fragmentation problem: analysis and synthesis |
| |
Authors: | Manuel Aprile Natalia Castro Graciela Ferreira Juan Piccini Franco Robledo Pablo Romero |
| |
Affiliation: | Laboratorio de Probabilidad y Estadística, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay |
| |
Abstract: | Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst‐case analysis of a random attack. We can choose a fixed number of individuals for protection, and a nonprotected target node immediately destroys all reachable nodes. The goal is to minimize the expected number of destroyed nodes in the network. In this paper, we address the GFP by several approaches: metaheuristics, approximation algorithms, polytime methods for specific instances, and exact methods for small instances. The computational complexity of the GFP is included in our analysis, where we formally prove that the corresponding decision version of the problem is ‐complete. Furthermore, a strong inapproximability result holds: there is no polynomial approximation algorithm with factor lower than 5/3, unless . This promotes the study of specific instances of the problem for tractability and/or exact methods in exponential time. As a synthesis, we propose new vulnerability/connectivity metrics and an interplay with game theory using a closely related combinatorial problem called component order connectivity. |
| |
Keywords: | vulnerability metrics graph fragmentation problem computational complexity approximation algorithms metaheuristics game theory |
|
|