The Complexity of Dominating Set Reconfiguration (Q3449837): Difference between revisions

@@ Property / cites work @@
+Dominating sets for split and bipartite graphs
@@ Property / cites work: Dominating sets for split and bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+The \(k\)-dominating graph
@@ Property / cites work: The \(k\)-dominating graph / rank @@
+Normal rank
@@ Property / cites work @@
+PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration of Vertex Covers in a Graph
@@ Property / cites work: Reconfiguration of Vertex Covers in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of independent set reconfigurability problems
+Normal rank
@@ Property / cites work @@
+Vertex Cover Reconfiguration and Beyond
@@ Property / cites work: Vertex Cover Reconfiguration and Beyond / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of reconfiguration problems
+Normal rank
@@ Property / cites work @@
+Reconfiguration of dominating sets
@@ Property / cites work: Reconfiguration of dominating sets / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of change
@@ Property / cites work: The complexity of change / rank @@
+Normal rank