Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals

DOI10.1007/978-3-030-50026-9_31MaRDI QIDQ5042264zbMATH OpenOpenAlexFDO

Authors Akihiro Yamamura, Riki Kase, Tatiana Baginová Jajcayová

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

groupoid actionsgroupoidsprefix reversalsburnt pancake problemrearrangement problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1947393 (Why is no real title available?)
• scientific article; zbMATH DE number 1761434 (Why is no real title available?)
• scientific article; zbMATH DE number 6472609 (Why is no real title available?)
• An (18/11)n upper bound for sorting by prefix reversals
• Bounds for sorting by prefix reversal
• On the Diameter of the Pancake Network
• On the problem of sorting burnt pancakes
• Rearranging two dimensional arrays by prefix reversals

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

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