A linear Algorithm For The Eternal Feedback Vertex Set on Interval Graphs* - Archive ouverte HAL
Conference Papers Year : 2023

A linear Algorithm For The Eternal Feedback Vertex Set on Interval Graphs*

Abstract

The Eternal Feedback Vertex Set problem is a new model of protecting graphs using mobile guards, which is usually modeled using a two-players game; a defender and an attacker. This model is based on an initial selection, by the defender, of a dominating feedback vertex set F used to hold guards, where a guard can be moved to a neighboring attacked vertex of F. The resulting guard configuration must be also a dominating feedback vertex set. In this paper, we prove that the eternal feedback vertex number F ∞ (G), which is the minimal cardinality of F , on an interval graph G depends on the number of cliques in G. Then, we develop a linear algorithm for finding the eternal feedback vertex set on G.
Fichier principal
Vignette du fichier
DYAB_LALOU_KHEDDOUCI.pdf (272.33 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04197633 , version 1 (08-09-2023)

Identifiers

  • HAL Id : hal-04197633 , version 1

Cite

Nour Dyab, Mohammed Lalou, Hamamache Kheddouci. A linear Algorithm For The Eternal Feedback Vertex Set on Interval Graphs*. International Conference on Control, Decision and Information Technologies, Jul 2023, Rom, Italy. ⟨hal-04197633⟩
40 View
53 Download

Share

More