Parameterized complexity of minimum membership dominating set

DOI10.1007/978-3-030-96731-4_24OpenAlexW3207099282MaRDI QIDQ2154108FDOQ2154108

Authors: Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi 

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2110.06656

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Fundamentals of parameterized complexity
• Title not available (Why is that?)
• Minimum-weight triangulation is NP-hard
• Parameterized algorithms
• On the parameterized complexity of multiple-interval graph problems
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
• Computing and Combinatorics
• On the parameterized complexity of \([1,j]\)-domination problems
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints

Cited In (3)

• On the complexity of fixed parameter clique and dominating set
• Parameterized complexity of minimum membership dominating set
• A note on the complexity of minimum dominating set

This page was built for publication: Parameterized 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 Q2154108)