Linear-time algorithm for sliding tokens on trees (Q496016): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2015.07.037
@@ Property / DOI: 10.1016/j.tcs.2015.07.037 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2169085828
@@ Property / OpenAlex ID: W2169085828 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6576
@@ Property / arXiv ID: 1406.6576 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+The complexity of rerouting shortest paths
@@ Property / cites work: The complexity of rerouting shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Set Reconfiguration in Cographs
@@ Property / cites work: Independent Set Reconfiguration in Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+Reconfiguring Independent Sets in Claw-Free Graphs
+Normal rank
@@ Property / cites work @@
+Finding paths between 3-colorings
@@ Property / cites work: Finding paths between 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithm for Sliding Tokens on Trees
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+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 @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of the subset sum reconfiguration problem
+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 list edge-colorings in a graph
@@ Property / cites work: Reconfiguration of list edge-colorings in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity for Token Jumping on Graphs
+Normal rank
@@ Property / cites work @@
+Reconfiguration of list \(L(2,1)\)-labelings in a graph
+Normal rank
@@ Property / cites work @@
+Shortest paths between shortest paths
@@ Property / cites work: Shortest paths between shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of independent set reconfigurability problems
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the Boolean connectivity problem for \(k\)-CNF
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of reconfiguration problems
+Normal rank
@@ Property / cites work @@
+Reconfiguration over Tree Decompositions
@@ Property / cites work: Reconfiguration over Tree Decompositions / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2015.07.037
@@ Property / DOI: 10.1016/J.TCS.2015.07.037 / rank @@
+Normal rank