An (18 / 11) n upper bound for sorting by prefix reversals

Theoretical Computer Science

Volumn 410, Issue 36, 2009, Pages 3372-3390

  Chitturi, B ^a   Fahle, W ^a   Meng, Z ^a   Morales, L ^a   Shields, C O ^a   Sudborough, I H ^a   Voit, W ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

Pancake network; Pancake problem; Permutations; Sorting by prefix reversals; Upper bounds

Indexed keywords

PANCAKE NETWORK; PANCAKE PROBLEM; PANCAKE PROBLEMS; PERMUTATIONS; UPPER BOUND; UPPER BOUNDS;

TERMINOLOGY;

EID: 67650983125     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.04.045     Document Type: Article

References (8)

1. Akers S., and Krishnamurthy B. A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 4 (1989) 555-566
2. Cohen D.S., and Blum M. Improved bounds for sorting pancakes under a conjecture. Discrete Appl. Math. 61 (1995) 105-120
3. Gates W.H., and Papadimitriou C.H. Bounds for sorting by prefix reversal. Discrete Math. 27 (1979) 47-57
4. Heydari M.H., and Sudborough I.H. On the diameter of the pancake network. J. Algorithms 25 (1997) 67-94
5. Y. Kounoike, K. Kaneko, Y. Shinano, Computing the diameters of 14- and 15-pancake graphs, in: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 2005, 2005
6. K. Kaneko, Y. Shinano, Personal communication
7. N.J.A. Sloane (Ed.) The on-line encyclopedia of integer sequences, 2003. Published electronically at: http://www.research.att.com/~njas/sequences/
8. www.utdallas.edu/~hal/PancakeSolution