Parameterized complexity of minimum membership dominating set
type: Item
instance of: scholarly article
title: Parameterized complexity of minimum membership dominating set
arXiv ID: 2110.06656
author: Akanksha Agrawal
author: Pratibha Choudhary
author: N. S. Narayanaswamy
author: K. K. Nisha
author: Vijayaragunathan Ramamoorthi
published in: Algorithmica
publication date: 2023-11-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/2110.06656
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7767696
zbMATH Keywords: dominating set
zbMATH Keywords: pathwidth
zbMATH Keywords: vertex cover number
zbMATH Keywords: FPT
zbMATH Keywords: split graphs
zbMATH Keywords: planar bipartite graphs
MaRDI profile type: Publication
OpenAlex ID: W4380488849
cites work: Q4198056
cites work: Q4368728
cites work: Computing and Combinatorics
cites work: Parameterized complexity of minimum membership dominating set
cites work: Q4699283
cites work: On the parameterized complexity of multiple-interval graph problems
cites work: Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
cites work: Q3305723
cites work: Minimum Membership Set Covering and the Consecutive Ones Property
cites work: Minimum membership hitting sets of axis parallel segments
cites work: Minimum membership covering and hitting
cites work: Perfect codes in graphs
cites work: Q4017197
cites work: Perfect Codes in Cayley Graphs
cites work: Perfect codes over graphs
cites work: Q3495221
cites work: Q3802605
cites work: On perfect codes in Cartesian products of graphs
cites work: Perfect Code is \(W[1]\)-complete
cites work: \([1,2]\)-sets in graphs
cites work: On the parameterized complexity of \([1,j]\)-domination problems
cites work: Parameterized Algorithms
cites work: Fundamentals of parameterized complexity
cites work: Minimum-weight triangulation is NP-hard
cites work: The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
DOI: 10.1007/S00453-023-01139-7
description: scientific article; zbMATH DE number 7767696