Parameterized complexity of weighted target set selection

Consider a graph G where each vertex has a threshold. A vertex v in G is activated if the number of active vertices adjacent to v is at least as many as its threshold. A vertex subset A0 of G is a target set if eventually all vertices in G are activated by initially activating vertices of A0. The Ta...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1051; S. 115414
Hauptverfasser:	Suzuki, Takahiro, Kimura, Kei, Suzuki, Akira, Tamura, Yuma, Zhou, Xiao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 09.10.2025
Schlagworte:	Graph algorithms Parameterized complexity Target set selection Graph algorithms Target set selection 05C85 68Q17 Parameterized complexity
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!