Parameterized dominating set problem in chordal graphs: Complexity and lower bound
From MaRDI portal
Publication:839675
DOI10.1007/S10878-008-9141-5zbMATH Open1170.90508OpenAlexW2039933854MaRDI QIDQ839675FDOQ839675
Publication date: 2 September 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9141-5
Cites Work
- Title not available (Why is that?)
- Graph minors. V. Excluding a planar graph
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Graph minors. II. Algorithmic aspects of tree-width
- A Characterization of Comparability Graphs and of Interval Graphs
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Dominating Sets in Chordal Graphs
- Polynomial-time data reduction for dominating set
- Graph minors. III. Planar tree-width
- Linear FPT reductions and computational lower bounds
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- Graph minors. IV: Tree-width and well-quasi-ordering
- STACS 2005
- Parameterized Complexity of Independence and Domination on Geometric Graphs
Cited In (6)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
- On finding the longest antisymmetric path in directed acyclic graphs
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- On the induced matching problem in Hamiltonian bipartite graphs
- Peptide sequencing via graph path decomposition
This page was built for publication: Parameterized dominating set problem in chordal graphs: Complexity and lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839675)
