Feasibility of motion planning on acyclic and strongly connected directed graphs (Q708329): Difference between revisions

@@ Property / cites work @@
+A linear time algorithm for the feasibility of pebble motion on trees
+Normal rank
@@ Property / cites work @@
+Optimal pebble motion on a tree
@@ Property / cites work: Optimal pebble motion on a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard
+Normal rank
@@ Property / cites work @@
+Q4252733
@@ Property / cites work: Q4252733 / rank @@
+Normal rank
@@ Property / cites work @@
+Planning Algorithms
@@ Property / cites work: Planning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5311854
@@ Property / cites work: Q5311854 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph puzzles, homotopy, and the alternating group
+Normal rank