Tighter upper bound for sorting permutations with prefix transpositions (Q497672): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2015.07.059
+Normal rank
@@ Property / OpenAlex ID @@
+W1131689765
@@ Property / OpenAlex ID: W1131689765 / rank @@
+Normal rank
@@ Property / cites work @@
+A group-theoretic model for symmetric interconnection networks
+Normal rank
@@ Property / cites work @@
+Sorting by Transpositions Is Difficult
@@ Property / cites work: Sorting by Transpositions Is Difficult / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting by Transpositions
@@ Property / cites work: Sorting by Transpositions / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding prefix transposition distance for strings and permutations
+Normal rank
@@ Property / cites work @@
+UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE
+Normal rank
@@ Property / cites work @@
+Q3393448
@@ Property / cites work: Q3393448 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting by bounded block-moves
@@ Property / cites work: Sorting by bounded block-moves / rank @@
+Normal rank
@@ Property / cites work @@
+A simpler and faster 1.5-approximation algorithm for sorting by transpositions
+Normal rank
@@ Property / cites work @@
+Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
+Normal rank