The Time Complexity of the Token Swapping Problem and Its Parallel Variants (Q2980932): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-53925-6_35
+Normal rank
@@ Property / OpenAlex ID @@
+W2564453173
@@ Property / OpenAlex ID: W2564453173 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3709907
@@ Property / cites work: Q3709907 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum-length generator sequence problem is NP-hard
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding minimum-length generator sequences
+Normal rank
@@ Property / cites work @@
+The Time Complexity of the Token Swapping Problem and Its Parallel Variants
+Normal rank
@@ Property / cites work @@
+Q4606338
@@ Property / cites work: Q4606338 / rank @@
+Normal rank
@@ Property / cites work @@
+How to write a permutation as a product of involutions (and why you might care)
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Swapping Colored Tokens on Graphs
@@ Property / cites work: Swapping Colored Tokens on Graphs / rank @@
+Normal rank