Parameterized complexity of generalized domination problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10126183" target="_blank" >RIV/00216208:11320/12:10126183 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2010.11.012" target="_blank" >http://dx.doi.org/10.1016/j.dam.2010.11.012</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2010.11.012" target="_blank" >10.1016/j.dam.2010.11.012</a>
Alternative languages
Result language
angličtina
Original language name
Parameterized complexity of generalized domination problems
Original language description
Given two sets a. p of non-negative integers, a set S of vertices of a graph G is (a. p)dominating if |S boolean AND N(v)| is an element of sigma for every vertex v is an element of S. and |S boolean AND N(v)| is an element of rho for every v S. This concept, introduced by Telle in 1990's, generalizes and unifies several variants of graph domination studied separately before. We study the parameterized complexity of (sigma, rho)-domination in this general setting. Among other results, we show that the existence of a (sigma, rho)-dominating set of size k (and at most k) are W[1]-complete problems (when parameterized by k) for any pair of finite sets a and p. We further present results on dual parameterization by n - k, and results on certain infinite sets (in particular for a. p being the sets of even and odd integers).
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Applied Mathematics
ISSN
0166-218X
e-ISSN
—
Volume of the periodical
160
Issue of the periodical within the volume
6
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
13
Pages from-to
780-792
UT code for WoS article
000302981900009
EID of the result in the Scopus database
—