An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-011-9533-2
@@ Property / DOI: 10.1007/s00453-011-9533-2 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-011-9533-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1977068662
@@ Property / OpenAlex ID: W1977068662 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms and Hardness for Domination with Propagation
+Normal rank
@@ Property / cites work @@
+The PMU Placement Problem
@@ Property / cites work: The PMU Placement Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Refined memorization for vertex cover
@@ Property / cites work: Refined memorization for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396567
@@ Property / cites work: Q3396567 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+A measure &amp; conquer approach for the analysis of exact algorithms
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Improved algorithms and complexity results for power domination in graphs
+Normal rank
@@ Property / cites work @@
+Domination in Graphs Applied to Electric Power Networks
+Normal rank
@@ Property / cites work @@
+Parameterized power domination complexity
@@ Property / cites work: Parameterized power domination complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
+Normal rank
@@ Property / cites work @@
+An Amortized Search Tree Analysis for k-Leaf Spanning Tree
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+On feedback vertex sets and nonseparating independent sets in cubic graphs
+Normal rank
@@ Property / cites work @@
+Q4910758
@@ Property / cites work: Q4910758 / rank @@
+Normal rank
@@ Property / cites work @@
+Inclusion/Exclusion Meets Measure and Conquer
@@ Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Power domination in block graphs
@@ Property / cites work: Power domination in block graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-011-9533-2
@@ Property / DOI: 10.1007/S00453-011-9533-2 / rank @@
+Normal rank