On the complexity of minimum membership dominating set

DOI10.1016/J.TCS.2026.116121MaRDI QIDQ7319266zbMATH OpenFDO

Authors D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman

Publication date 25 August 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116121

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• \([1,2]\)-sets in graphs
• A fast branching algorithm for cluster vertex deletion
• Algorithms for minimum membership dominating set problem
• Approximating clique-width and branch-width
• Computing and Combinatorics
• Fast Algorithms for Join Operations on Tree Decompositions
• scientific article; zbMATH DE number 91051 (Why is no real title available?)
• Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
• Minimum eccentricity shortest path problem with respect to structural parameters
• Minimum membership covering and hitting
• Minimum membership hitting sets of axis parallel segments
• Minimum Membership Set Covering and the Consecutive Ones Property
• On the clique-width of some perfect graph classes
• On the parameterized complexity of \([1,j]\)-domination problems
• Parameterized algorithms
• Parameterized complexity of minimum membership dominating set
• Perfect Code is \(W[1]\)-complete
• Perfect codes in Cayley graphs
• Perfect codes in graphs
• Perfect codes over graphs
• Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs
• Upper bounds to the clique width of graphs

This page was built for publication: On the complexity of minimum membership dominating set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319266)