On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width

A mixed dominating set for a graph $G = (V,E)$ is a set $S\subseteq V \cup E$ such that every element $x \in (V \cup E) \backslash S$ is either adjacent or incident to an element of $S$. The mixed domination number of a graph $G$, denoted by $\gamma_m(G)$, is the minimum cardinality of mixed dominat...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník 20 no. 2; číslo Graph Theory
Hlavní autori:	Rajaati, M., Hooshmandasl, M. R., Dinneen, M. J., Shakiba, A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Discrete Mathematics & Theoretical Computer Science 31.07.2018
Predmet:	05c85 computer science - data structures and algorithms computer science - discrete mathematics g.2.2
ISSN:	1365-8050, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!