Pages that link to "Item:Q3386613"
From MaRDI portal
The following pages link to On the heapability of finite partial orders (Q3386613):
Displayed 4 items.
- The maximum binary tree problem (Q2041978) (← links)
- Efficient methods of calculating the number of heapable permutations (Q2691575) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree (Q6089651) (← links)