Sorting by Prefix Reversals

@inproceedings{Popov2010SortingBP,
  title={Sorting by Prefix Reversals},
  author={Vladimir Yu. Popov},
  year={2010}
}
The pancake problem, which has attracted considerable attention, concerns the number of prefix reversals needed to sort the elements of an arbitrary permutation. The number of prefix reversals to sort permutations is also the diameter of the often studied n-dimensional Pancake network. We consider restricted pancake problem, when only k of the possible n− 1 prefix reversals are allowed. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Bounds for sorting by prefix reversal

Discrete Mathematics • 1979
View 4 Excerpts
Highly Influenced

Rank and status in semigroup theory

A. Cherubini, J. Howie, B. Piochi
Communications in Algebra, V32, N7, pp. 2783-2802 7 /04. IAENG International Journal of Applied Mathematics, 40:4, IJAM_40_4_04 (Advance online publication: 23 November 2010) ______________________________________________________________________________________ • 2010
View 1 Excerpt

Similar Papers

Loading similar papers…