Presentation is loading. Please wait.

Presentation is loading. Please wait.

Bounds for Sorting by Prefix Reversal -- Pancake Problem

Similar presentations


Presentation on theme: "Bounds for Sorting by Prefix Reversal -- Pancake Problem"— Presentation transcript:

1 Bounds for Sorting by Prefix Reversal -- Pancake Problem
2004/05/12 報告人:d 許凱平 d 張傑生

2 Outline Introduction to pancake problem
Bounds for sorting by prefix reversal Pancake Network

3 Reference Steven Rudich, Great Theoretical Ideas In Computer Science Spring 2004, CMU Bill Gates & Christos Papadimitriou, Bounds For Sorting By Prefix Reversal. Discrete Mathematics, vol 27, pp 47-57, 1979. H. Heydari & H. I. Sudborough, On the Diameter of the Pancake Network. Journal of Algorithms, vol 25, pp 67-94, 1997


Download ppt "Bounds for Sorting by Prefix Reversal -- Pancake Problem"

Similar presentations


Ads by Google