Perfect domination and small cycles (Q5367522): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Code is \(W[1]\)-complete
@@ Property / cites work: Perfect Code is \(W[1]\)-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating set is fixed parameter tractable in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Domination problems in nowhere-dense classes of graphs
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized approximation of dominating set problems
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Q4017197
@@ Property / cites work: Q4017197 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Kernelization of edge perfect code and its variants
+Normal rank
@@ Property / cites work @@
+Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
+Normal rank
@@ Property / cites work @@
+Weighted efficient domination problem on some perfect graphs
+Normal rank
@@ Property / cites work @@
+Independent domination in chordal graphs
@@ Property / cites work: Independent domination in chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The kernelization complexity of connected domination in graphs with (no) small cycles
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Dominating sets in <i>n</i>‐cubes
@@ Property / cites work: Dominating sets in <i>n</i>‐cubes / rank @@
+Normal rank
@@ Property / cites work @@
+The weighted perfect domination problem
@@ Property / cites work: The weighted perfect domination problem / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1793830917500306
+Normal rank
@@ Property / OpenAlex ID @@
+W2593365144
@@ Property / OpenAlex ID: W2593365144 / rank @@
+Normal rank