Parameterized complexity of minimum membership dominating set
type: Item
instance of: scholarly article
title: Parameterized complexity of minimum membership dominating set
DOI: 10.1007/978-3-030-96731-4_24
author: Akanksha Agrawal
author: Pratibha Choudhary
author: N. S. Narayanaswamy
author: K. K. Nisha
author: Vijayaragunathan Ramamoorthi
publication date: 2022-07-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/2110.06656
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7556579
MaRDI profile type: Publication
OpenAlex ID: W3207099282
cites work: Parameterized Algorithms
cites work: Fundamentals of parameterized complexity
cites work: The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
cites work: On the parameterized complexity of multiple-interval graph problems
cites work: Q4198056
cites work: Computing and Combinatorics
cites work: On the parameterized complexity of \([1,j]\)-domination problems
cites work: Minimum-weight triangulation is NP-hard
cites work: Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
description: scientific article