On the heapability of finite partial orders

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 th...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 22 no. 1; no. Combinatorics; pp. 1 - 23
Main Authors:	Balogh, János, Bonchiş, Cosmin, Diniş, Diana, Istrate, Gabriel, Todinca, Ioan
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.01.2020 Discrete Mathematics & Theoretical Computer Science
Subjects:	05a18, 68c05, 60k35 Algorithms Combinatorics Computation Computer Science computer science - data structures and algorithms computer science - discrete mathematics Data Structures and Algorithms Decomposition Greedy algorithms Integers Intervals mathematics - combinatorics Nodes Permutations Polynomials Sequences Set theory
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!