Pancake flipping is hard

DOI10.1016/J.JCSS.2015.02.003MaRDI QIDQ6826667zbMATH OpenFDO

Authors Laurent Bulteau, Guillaume Fertin, Irena Rusu

Publication date 31 August 2015

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2015.02.003

zbMATH Keywords

computational complexitypancake problempermutationsprefix reversals

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• On the spectra of prefix-reversal graphs
• A note on some spectral properties of generalised pancake graphs

This page was built for publication: Pancake flipping is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826667)