Skip to main content
SpringerLink
Log in

Parameterized Complexity of Minimum Membership Dominating Set

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Given a graph \(G=(V,E)\) and an integer k, the Minimum Membership Dominating Set (MMDS) problem seeks to find a dominating set \(S \subseteq V\) of G such that for each \(v \in V\), \(\vert N[v] \cap S\vert \) is at most k. We investigate the parameterized complexity of the problem and obtain the following results for the MMDS problem. First, we show that the MMDS problem is NP-hard even on planar bipartite graphs. Next, we show that the MMDS problem is W[1]-hard for the parameter pathwidth (and thus, for treewidth) of the input graph. Then, for split graphs, we show that the MMDS problem is W[2]-hard for the parameter k. Further, we complement the pathwidth lower bound by an FPT algorithm when parameterized by the vertex cover number of input graph. In particular, we design a \(2^{{\mathcal {O}}({\textbf {v}}{} {\textbf {c}})} \vert V\vert ^{{\mathcal {O}}(1)}\) time algorithm for the MMDS problem where \(\textbf{vc}\) is the vertex cover number of the input graph. Finally, we show that the running time lower bound based on ETH is tight for the vertex cover parameter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. For a vertex v in a graph \(G = (V,E)\), the closed neighborhood of v in G, \(N_G[v]\), is the set \(\{u \in V \mid uv \in E\} \cup \{v\}\).

References

  1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    MATH  Google Scholar 

  2. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Pure and Applied Mathematics, vol. 208. Dekker, New York (1998)

    MATH  Google Scholar 

  3. Kuhn, F., von Rickenbach, P., Wattenhofer, R., Welzl, E., Zollinger, A.: Interference in cellular networks: The minimum membership set cover problem. In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16–29, 2005, Proceedings, pp. 188–198 (2005)

  4. Agrawal, A., Choudhary, P., Narayanaswamy, N.S., Nisha, K.K., Ramamoorthi, V.: Parameterized complexity of minimum membership dominating set. In: Mutzel, P., Rahman, M.S., Slamin (eds.) WALCOM: Algorithms and Computation. Springer, Cham (2022)

    Google Scholar 

  5. Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25–29, 1997, Proceedings, pp. 19–36 (1997)

  6. Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53–61 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Raman, V., Saurabh, S.: Short cycles make w-hard problems hard: Fpt algorithms for w-hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Belmonte, R., Ghadikolaei, M.K., Kiyomi, M., Lampis, M., Otachi, Y.: How bad is the freedom to flood-it. In: 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 100, pp. 5–1513. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)

  9. Downey, R.G., Fellows, M.R.: Fixed-parameter intractability. In: Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, June 22–25, 1992, pp. 36–49 (1992)

  10. Dom, M., Guo, J., Niedermeier, R., Wernicke, S.: Minimum membership set covering and the consecutive ones property. In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6–8, 2006, Proceedings, pp. 339–350 (2006)

  11. Dhannya, S.M., Narayanaswamy, N.S., Ramya, C.: Minimum membership hitting sets of axis parallel segments. In: Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2–4, 2018, Proceedings, pp. 638–649 (2018)

  12. Mitchell, J.S.B., Pandit, S.: Minimum membership covering and hitting. In: WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27–March 2, 2019, Proceedings, pp. 394–406 (2019)

  13. Biggs, N.: Perfect codes in graphs. J. Comb. Theory Se. B 15(3), 289–296 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  14. Fellows, M.R., Hoover, M.N.: Perfect domination. Australas. J Comb. 3, 141–150 (1991)

    MathSciNet  MATH  Google Scholar 

  15. Huang, H., Xia, B., Zhou, S.: Perfect codes in cayley graphs. SIAM J. Discret. Math. 32(1), 548–559 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kratochvíl, J.: Perfect codes over graphs. J. Comb. Theory Ser. B 40(2), 224–228 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kratochvíl, J.: Perfect codes in graphs and their powers. PhD dissertation(in czech), Charles University, Prague (1987)

  18. Kratochvíl, J., Krivánek, M.: On the computational complexity of codes in graphs. In: Mathematical Foundations of Computer Science 1988, MFCS’88, Carlsbad, Czechoslovakia, August 29+-September 2, 1988, Proceedings. Lecture Notes in Computer Science, vol. 324, pp. 396–404. Springer, Berlin Heidelberg (1988)

  19. Mollard, M.: On perfect codes in cartesian products of graphs. Eur. J. Comb. 32(3), 398–403 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Cesati, M.: Perfect code is w[1]-complete. Inf. Process. Lett. 81(3), 163–168 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. Telle, J.A.: Complexity of domination-type problems in graphs. Nord. J. Comput. 1(1), 157–171 (1994)

    MathSciNet  Google Scholar 

  22. Telle, J.A.: Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees. PhD thesis, USA (1994). UMI Order No. GAX95-02388

  23. Chapelle, M.: Parameterized complexity of generalized domination problems on bounded tree-width graphs. CoRR arXiv:1004.2642 (2010)

  24. Chellali, M., Haynes, T.W., Hedetniemi, S.T., McRae, A.A.: [1, 2]-sets in graphs. Discret. Appl. Math. 161(18), 2885–2893 (2013)

    Article  MATH  Google Scholar 

  25. Meybodi, M.A., Fomin, F.V., Mouawad, A.E., Panolan, F.: On the parameterized complexity of [1, j]-domination problems. Theor. Comput. Sci. 804, 207–218 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  26. Diestel, R.: Graph Theory, 4th Edition. Graduate texts in mathematics, vol. 173. Springer, Heidelberg (2012)

  27. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, 1st edn. Springer, New York (2015)

    Book  MATH  Google Scholar 

  28. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)

    Book  MATH  Google Scholar 

  29. Mulzer, W., Rote, G.: Minimum-weight triangulation is np-hard. J. ACM 55(2), 11–11129 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  30. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)

    Book  Google Scholar 

  31. Dvořák, P., Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Solving integer linear programs with a small number of global variables and constraints. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, pp. 607–613 (2017)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, IIT Madras, Chennai, 600036, India

    Akanksha Agrawal, N. S. Narayanaswamy, K. K. Nisha & Vijayaragunathan Ramamoorthi

  2. Faculty of Informatics, Czech Technical University in Prague, Prague, Czech Republic

    Pratibha Choudhary

Authors
  1. Akanksha Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pratibha Choudhary
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. S. Narayanaswamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. K. K. Nisha
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Vijayaragunathan Ramamoorthi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. K. Nisha.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Agrawal, A., Choudhary, P., Narayanaswamy, N.S. et al. Parameterized Complexity of Minimum Membership Dominating Set. Algorithmica 85, 3430–3452 (2023). https://doi.org/10.1007/s00453-023-01139-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-023-01139-7

Keywords

Search

Navigation