| Autor: |
János Balogh, Cosmin Bonchiş, Diana Diniş, Gabriel Istrate, Ioan Todinca |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Combinatorics (2020) |
| Druh dokumentu: |
article |
| ISSN: |
1365-8050 |
| DOI: |
10.23638/DMTCS-22-1-17 |
| Popis: |
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a minimal decomposition. On the other hand, in the particular case of sets and sequences of intervals we prove that this minimal decomposition can be computed by a simple greedy-type algorithm. The paper ends with a couple of open problems related to the analog of the Ulam-Hammersley problem for decompositions of sets and sequences of random intervals into heapable sets. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
