On the Diameter of the Pancake Network

Journal of Algorithms

Volumn 25, Issue 1, 1997, Pages 67-94

  Heydari, Mohammad H ^a   Sudborough, I Hal ^b  

^a JAMES MADISON UNIVERSITY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038643654     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0874     Document Type: Article

References (8)

1. S. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Computers 38 (1989), 555-566.
2. D. S. Cohen and M. Blum, "Improved bounds for sorting pancakes under a conjecture," Manuscript, Computer Science Division, University of California, Berkeley, 1992.
3. H. Dweighter, Amer. Math. Monthly 82 (1975), 1010.
4. M. R. Carey, D. S. Johnson, and S. Lin, Amer. Math. Monthly 84 (1977), 296.
5. W. H. Gates and C. H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Math. 27 (1979), 47-57.
6. M. H. Heydari and I. H. Sudborough, Pancake sorting is NP-complete, submitted for publication.
7. F. T. Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes," Morgan Kaufmann, San Mateo, CA, 1992.
8. D. P. Robbins, personal communication cited in W. H. Gates and C. H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Math. 27 (1979), 47-57.