Optimal binary representation of mosaic floorplans and Baxter permutations

DOI10.1007/978-3-642-29700-7_1MaRDI QIDQ2897977zbMATH OpenOpenAlexFDO

Authors Bryan Dawei He

Publication date 16 July 2012

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29700-7_1

zbMATH Keywords

Baxter permutationbinary representationmosaic floorplan

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorics in computer science (68R05)

Recommendations

• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• A bijection between permutations and floorplans, and its applications
• Subclasses of Baxter permutations based on pattern avoidance
• Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
• A (4n − 4)-Bit Representation of a Rectangular Drawing or Floorplan

Cited in

(3)

• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• A bijection between permutations and floorplans, and its applications
• Recent developments in floorplan representations

This page was built for publication: Optimal binary representation of mosaic floorplans and Baxter permutations

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