Sorting signed permutations by reversals using link-cut trees (Q1705654): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2017.12.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2777308084
@@ Property / OpenAlex ID: W2777308084 / rank @@
+Normal rank
@@ Property / cites work @@
+A construction for sets of integers with distinct subset sums
+Normal rank
@@ Property / cites work @@
+Q3234565
@@ Property / cites work: Q3234565 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3393448
@@ Property / cites work: Q3393448 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
+Normal rank
@@ Property / cites work @@
+Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
+Normal rank
@@ Property / cites work @@
+\(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Advances on sorting by reversals
@@ Property / cites work: Advances on sorting by reversals / rank @@
+Normal rank