Safe sets and in-dominating sets in digraphs

A non-empty subset S of the vertices of a digraph D is a safe set if (i) for every strongly connected component M of D−S, there exists a strongly connected component N of D[S] such that there exists an arc from M to N; and (ii) for every strongly connected component M of D−S and every strongly conne...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 346; S. 215 - 227
Hauptverfasser:	Bai, Yandong, Bang-Jensen, Jørgen, Fujita, Shinya, Ono, Hirotaka, Yeo, Anders
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 31.03.2024
Schlagworte:	In-dominating set NP-complete Polynomial algorithm Safe set Tournament NP-complete Safe set In-dominating set Polynomial algorithm Tournament
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!