Complexity of the Multilvel Critical Node Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2022

Complexity of the Multilvel Critical Node Problem

Résumé

In this work, we analyze a sequential game played in a graph called the Multilevel Critical Node problem (MCN). A defender and an attacker are the players of this game. The defender starts by preventively interdicting vertices (vaccination) from being attacked. Then, the attacker infects a subset of non-vaccinated vertices and, finally, the defender reacts with a protection strategy. We provide the first computational complexity results associated with MCN and its subgames. Moreover, by considering unitary, weighted, undirected and directed graphs, we clarify how the theoretical tractability or intractability of those problems vary. Our findings contribute with new NP-complete, ? p 2 -complete and ? p 3 -complete problems.
Fichier principal
Vignette du fichier
doc00035347.pdf (366.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03894879 , version 1 (12-12-2022)

Identifiants

Citer

Adel Nabli, Margarida Carvalho, Pierre Hosteins. Complexity of the Multilvel Critical Node Problem. Journal of Computer and System Sciences, 2022, 127, pp122-145. ⟨10.1016/j.jcss.2022.02.004⟩. ⟨hal-03894879⟩
6 Consultations
16 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More