Pages that link to "Item:Q1306396"
From MaRDI portal
The following pages link to On the tightness of the alternating-cycle lower bound for sorting by reversals (Q1306396):
Displayed 4 items.
- On the average number of reversals needed to sort signed permutations (Q1682880) (← links)
- Estimating the expected reversal distance after a fixed number of reversals (Q1883401) (← links)
- Can a breakpoint graph be decomposed into none other than 2-cycles? (Q2636497) (← links)
- Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (Q4632186) (← links)
