On the heapability of finite partial orders.

János Balogh Cosmin Bonchis Diana Dinis Gabriel Istrate Ioan Todinca

Published in: Discret. Math. Theor. Comput. Sci. (2020)

Keyphrases

partial order
partially ordered
total order
totally ordered
stable marriage
partial ordering
lattice structure
preference relations
finite number
precedence constraints
data structure
lower bound
dynamic environments
sequential patterns
dominance relation