Pages that link to "Item:Q1682880"
From MaRDI portal
The following pages link to On the average number of reversals needed to sort signed permutations (Q1682880):
Displaying 8 items.
- The average number of block interchanges needed to sort a permutation and a recent result of Stanley (Q989529) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- A topological framework for signed permutations (Q2359959) (← links)
- The distribution of cycles in breakpoint graphs of signed permutations (Q2446324) (← links)
- On reconstruction of signed permutations distorted by reversal errors (Q2470469) (← links)
- Improved upper bound for sorting permutations by prefix transpositions (Q2664958) (← links)
- Average-case analysis of perfect sorting by reversals (Q2890993) (← links)