Efficient methods of calculating the number of heapable permutations
From MaRDI portal
Publication:2691575
DOI10.1016/j.dam.2023.01.025OpenAlexW4320186796MaRDI QIDQ2691575
Michael H. Cho, Mario Tutuncu-Macias, Tony Tzolov, Benjamin Chao-Min Chen
Publication date: 29 March 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.01.025
Algorithms in computer science (68Wxx) Combinatorics in computer science (68R05) Combinatorial probability (60Cxx)
Uses Software
Cites Work
This page was built for publication: Efficient methods of calculating the number of heapable permutations