Advertisement

Algorithms and Hardness for Signed Domination

  • Jin-Yong Lin
  • Sheung-Hung PoonEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9076)

Abstract

A signed dominating function for a graph \(G=(V, E)\) is a function \(f\): \(V \rightarrow \{ +1, -1\}\) such that for all \(v \in V\), the sum of the function values over the closed neighborhood of \(v\) is at least one. The weight \(w(f(V))\) of signed dominating function \(f\) for vertex set \(V\) is the sum of \(f(v)\) for \(v \in V\). The signed domination number \(\gamma _s\) of \(G\) is the minimum weight of a signed dominating function for \(G\). The signed domination (SD) problem asks for a signed dominating function which contributes the signed domination number. First we show that the SD problem is W[2]-hard. Next we show that the SD problem on graphs of maximum degree six is APX-hard. Then we present constant-factor approximation algorithms for the SD problem on subcubic graphs, graphs of maximum degree four, and graphs of maximum degree five, respectively. In addition, we present an alternative and more direct proof for the NP-completeness of the SD problem on subcubic planar bipartite graphs. Lastly, we obtain an \(O^{*}(5.1957^k)\)-time FPT-algorithm for the SD problem on subcubic graphs \(G\), where \(k\) is the signed domination number of \(G\).

Keywords

Maximum Degree Domination Number Label Vertex Domination Problem Planar Bipartite Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288–298. Springer, Heidelberg (1997) CrossRefGoogle Scholar
  2. 2.
    Damaschke, P.: Minus signed dominating function in small-degree graphs. Discrete Appl. Math. 108, 53–64 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999) CrossRefGoogle Scholar
  4. 4.
    Faria, L., Hon, W.-K., Kloks, T., Liu, H.-H., Wang, T.-M., Wang, Y.-L.: On complexities of minus domination. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 178–189. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  5. 5.
    Hattingh, J.H., Henning, M.A., Slater, P.J.: The algorithmic complexity of signed dominating function in graphs. Australas. J. Comb. 12, 101–112 (1995)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Lee, C.-M.: Labelled signed dominating function and its variants, Ph.D. thesis, National Chung Cheng University, Taiwan (2006)Google Scholar
  7. 7.
    Zheng, Y., Wang, J., Feng, Q.: Kernelization and Lower Bounds of the Signed Domination Problem. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 261–271. Springer, Heidelberg (2013) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan, R.O.C.
  2. 2.School of Computing and InformaticsInstitut Teknologi BruneiGadongBrunei Darussalam

Personalised recommendations