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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 346; s. 215 - 227
Hlavní autori:	Bai, Yandong, Bang-Jensen, Jørgen, Fujita, Shinya, Ono, Hirotaka, Yeo, Anders
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.03.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!