Parameterized complexity of generalized domination problems
type: Item
instance of: scholarly article
title: Parameterized complexity of generalized domination problems
zbMATH Open document ID: 1241.05108
author: Petr A. Golovach
author: Ondřej Suchý
author: Jan Kratochvíl
published in: Discrete Applied Mathematics
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6033762
zbMATH Keywords: generalized domination
zbMATH Keywords: parameterized complexity
zbMATH Keywords: even set
zbMATH Keywords: odd set
MaRDI profile type: Publication
full work available at URL: j.dam.2010.11.012
OpenAlex ID: W2064310439
cites work: On the Boolean-Width of a Graph: Structure and Applications
cites work: Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
cites work: Faster Algorithms on Branch and Clique Decompositions
cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
cites work: Perfect Code is \(W[1]\)-complete
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Q4027320
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4393480
cites work: Threshold dominating sets and an improved characterization of \(W[2]\)
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: Parametrized complexity theory.
cites work: Sort and Search: exact algorithms for generalized domination
cites work: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
cites work: Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity
cites work: Parameterized Complexity of Generalized Domination Problems
cites work: MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS
cites work: Q4209364
cites work: Q4892794
cites work: Q4847026
cites work: The Grad of a Graph and Classes with Bounded Expansion
cites work: First order properties on nowhere dense structures
cites work: Grad and classes with bounded expansion. I: Decompositions
cites work: Grad and classes with bounded expansion. II: Algorithmic aspects
cites work: Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
cites work: On nowhere dense graphs
cites work: Q5710169
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
DOI: 10.1016/J.DAM.2010.11.012
description: scientific article; zbMATH DE number 6033762