Name
Abstract | ||
|---|---|---|
We prove that a stack of pancakes can be rearranged in all possible ways by a greedy process: Flip the maximum number of topmost pancakes that gives a new stack. We also show that the previous Gray code for rearranging pancakes (S. Zaks, A New Algorithm for Generation of Permutations BIT 24 (1984), 196-204) is a greedy process: Flip the minimum number of topmost pancakes that gives a new stack. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.endm.2013.10.056 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
greedy algorithm,pancake sorting,Gray code,permutations,prefix-reversal | Discrete mathematics,Combinatorics,Zaks,Permutation,Gray code,Greedy algorithm,Pancake sorting,Mathematics | Journal |
Volume | ISSN | Citations |
44 | 1571-0653 | 5 |
PageRank | References | Authors |
0.51 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aaron Williams | 1 | 139 | 20.42 |
| Joe Sawada | 2 | 66 | 9.11 |