Advertisement
Published in:
2012 | OriginalPaper | Chapter
FPT Results for Signed Domination
Authors : Ying Zheng, Jianxin Wang, Qilong Feng, Jianer Chen
Published in: Theory and Applications of Models of Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A function
f
:
v
→ { − 1, + 1} defined on the vertices of a graph
G
is a signed dominating function if the sum of its function values over any closed neighborhood is at least one. The weight of a signed dominating function is
f
(
V
) = ∑
f
(
v
), over all vertices
v
∈
V
. The signed domination number of a graph
G
, denoted by
γ
s
(
G
), equals the minimum weight of a signed dominating function of
G
. The decision problem corresponding to the problem of computing
γ
s
is an important NP-complete problem derived from social network. A signed dominating set is a set of vertices assigned the value + 1 under the function
f
in the graph. In this paper, we give some fixed parameter tractable results for signed dominating set problem, specifically the kernels for signed dominating set problem on general and special graphs. These results generalize the parameterized algorithm for this problem. Furthermore we propose a parameterized algorithm for signed dominating set problem on planar graphs.