Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals

DOI10.1007/978-3-030-50026-9_31OpenAlexW3036712389MaRDI QIDQ5042264

Tatiana Baginová Jajcayová, Riki Kase, Akihiro Yamamura

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-50026-9_31

zbMATH Keywords

groupoidsgroupoid actionsprefix reversalsburnt pancake problemrearrangement problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pancake flipping is hard
• An \((18/11)n\) upper bound for sorting by prefix reversals
• Bounds for sorting by prefix reversal
• Rearranging two dimensional arrays by prefix reversals
• On the problem of sorting burnt pancakes
• On the Diameter of the Pancake Network

This page was built for publication: Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals