Computing eternal vertex cover number of maximal outerplanar graphs in linear time

Eternal vertex cover problem is a variant of the classical vertex cover problem modeled as a two player attacker-defender game. Computing the eternal vertex cover number of graphs is known to be NP-hard in general and even for bipartite graphs. There is a quadratic complexity algorithm known for thi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1056; S. 115530
Hauptverfasser:	Babu, Jasine, Murali Krishnan, K., Prabhakaran, Veena, Warrier, Nandini J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 21.11.2025
Schlagworte:	Eternal vertex cover Linear time algorithm Maximal outerplanar graph Linear time algorithm Maximal outerplanar graph Eternal vertex cover
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!