Computing the diameters of 14- and 15-pancake graphs

Abstract

Computing the diameter of a pancake graph is equivalent to solving the "pancake sorting problem" (or "prefix reversal problem"), which is basically the problem of finding the maximum number of pancake flips one would need to perform in order to sort an arbitrary stack of pancakes. The diameter of a pancake graph can be computed by solving the shortest path… (More)
DOI: 10.1109/ISPAN.2005.31

Topics

Cite this paper

@article{Kounoike2005ComputingTD, title={Computing the diameters of 14- and 15-pancake graphs}, author={Yuusuke Kounoike and Keiichi Kaneko and Yuji Shinano}, journal={8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)}, year={2005}, pages={6 pp.-} }