Parameterized dominating set problem in chordal graphs: Complexity and lower bound
type: Item
instance of: scholarly article
title: Parameterized dominating set problem in chordal graphs: Complexity and lower bound
zbMATH Open document ID: 1170.90508
author: Chunmei Liu
author: Yinglei Song
published in: Journal of Combinatorial Optimization
publication date: 2009-09-02T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5601555
zbMATH Keywords: chordal graphs
zbMATH Keywords: dominating set
zbMATH Keywords: parameterized complexity
zbMATH Keywords: lower bound
zbMATH Keywords: interval graphs
MaRDI profile type: Publication
full work available at URL: s10878-008-9141-5
OpenAlex ID: W2039933854
cites work: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
cites work: Polynomial-time data reduction for dominating set
cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Dominating Sets in Chordal Graphs
cites work: Linear FPT reductions and computational lower bounds
cites work: STACS 2005
cites work: Q4198056
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graph minors. III. Planar tree-width
cites work: Graph minors. IV: Tree-width and well-quasi-ordering
cites work: Graph minors. V. Excluding a planar graph
DOI: 10.1007/S10878-008-9141-5
description: scientific article; zbMATH DE number 5601555