Geodesic
On the heapability of finite partial orders
Discrete mathematics & theoretical computer science, Tome 22 (2020-2021) no. 1

Voir la notice de l'article provenant de la source Episciences

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.
DOI : 10.23638/DMTCS-22-1-17
Classification : 06A07, 68Q25 
@article{DMTCS_2020_22_1_a19,
     author = {Balogh, J\'anos and Bonchi\c{s}, Cosmin and Dini\c{s}, Diana and Istrate, Gabriel and Todinca, Ioan},
     title = {On the heapability of finite partial orders},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {22},
     number = {1},
     year = {2020-2021},
     doi = {10.23638/DMTCS-22-1-17},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-22-1-17/}
}
TY  - JOUR
AU  - Balogh, János
AU  - Bonchiş, Cosmin
AU  - Diniş, Diana
AU  - Istrate, Gabriel
AU  - Todinca, Ioan
TI  - On the heapability of finite partial orders
JO  - Discrete mathematics & theoretical computer science
PY  - 2020-2021
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-22-1-17/
DO  - 10.23638/DMTCS-22-1-17
LA  - en
ID  - DMTCS_2020_22_1_a19
ER  - 
%0 Journal Article
%A Balogh, János
%A Bonchiş, Cosmin
%A Diniş, Diana
%A Istrate, Gabriel
%A Todinca, Ioan
%T On the heapability of finite partial orders
%J Discrete mathematics & theoretical computer science
%D 2020-2021
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-22-1-17/
%R 10.23638/DMTCS-22-1-17
%G en
%F DMTCS_2020_22_1_a19
Balogh, János; Bonchiş, Cosmin; Diniş, Diana; Istrate, Gabriel; Todinca, Ioan. On the heapability of finite partial orders. Discrete mathematics & theoretical computer science, Tome 22 (2020-2021) no. 1. doi: 10.23638/DMTCS-22-1-17

Cité par Sources :