On the heapability of finite partial orders
From MaRDI portal
Publication:3386613
DOI10.23638/DMTCS-22-1-17zbMath1484.06009arXiv1706.01230MaRDI QIDQ3386613
Ioan Todinca, Cosmin Bonchiş, Diana Diniş, János Balogh, Gabriel I. Istrate
Publication date: 5 January 2021
Full work available at URL: https://arxiv.org/abs/1706.01230
Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07)
Related Items (4)
Efficient methods of calculating the number of heapable permutations ⋮ The Maximum Binary Tree Problem. ⋮ Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree ⋮ The maximum binary tree problem
This page was built for publication: On the heapability of finite partial orders