AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993): Difference between revisions

@@ Property / cites work @@
+Simple permutations and pattern restricted permutations
+Normal rank
@@ Property / cites work @@
+A more efficient algorithm for perfect sorting by reversals
+Normal rank
@@ Property / cites work @@
+Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Boltzmann Samplers for the Random Generation of Combinatorial Structures
+Normal rank
@@ Property / cites work @@
+A calculus for the random generation of labelled combinatorial structures
+Normal rank
@@ Property / cites work @@
+Transforming cabbage into turnip
@@ Property / cites work: Transforming cabbage into turnip / rank @@
+Normal rank
@@ Property / cites work @@
+Finding pattern matchings for permutations
@@ Property / cites work: Finding pattern matchings for permutations / rank @@
+Normal rank
@@ Property / cites work @@
+The Asymptotic Distribution of Runs of Consecutive Elements
+Normal rank
@@ Property / cites work @@
+Advances on sorting by reversals
@@ Property / cites work: Advances on sorting by reversals / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms to enumerate all common intervals of two permutations
+Normal rank