FPT Results for Signed Domination Conference Paper uri icon

abstract

  • 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. 2012 Springer-Verlag.

name of conference

  • Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings

published proceedings

  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

author list (cited authors)

  • Zheng, Y., Wang, J., Feng, Q., & Chen, J.

citation count

  • 2

complete list of authors

  • Zheng, Ying||Wang, Jianxin||Feng, Qilong||Chen, Jianer

publication date

  • May 2012