Perfect domination and small cycles
From MaRDI portal
Publication:5367522
DOI10.1142/S1793830917500306zbMath1373.05141OpenAlexW2593365144MaRDI QIDQ5367522
Publication date: 20 October 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500306
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Kernelization of edge perfect code and its variants
- Fundamentals of parameterized complexity
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
- The kernelization complexity of connected domination in graphs with (no) small cycles
- Dominating set is fixed parameter tractable in claw-free graphs
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- The weighted perfect domination problem
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Parameterized approximation of dominating set problems
- On the parameterized complexity of multiple-interval graph problems
- Independent domination in chordal graphs
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- Weighted efficient domination problem on some perfect graphs
- Perfect Code is \(W[1\)-complete]
- Domination Problems in Nowhere-Dense Classes
- Dominating sets in n‐cubes
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs
This page was built for publication: Perfect domination and small cycles
