Algorithms for Dualization over Products of Partially Ordered Sets

DOI10.1137/050622250zbMath1185.68356OpenAlexW1982553560MaRDI QIDQ5189532

Khaled M. Elbassioni

Publication date: 17 March 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/97f12e9fa5087ab1fa13c618567ac257ff3c437a

zbMATH Keywords

latticesforestsordered setsenumeration algorithmshypergraph transversalsmonotone propertiesduality testinginfrequent elementsmonotone generation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics of discrete mathematics in relation to computer science (68R01)

Related Items (7)

Extended dualization: application to maximal pattern mining ⋮ On Dualization over Distributive Lattices ⋮ Dualization in lattices given by ordered sets of irreducibles ⋮ On the dualization in distributive lattices and related problems ⋮ Translating between the representations of a ranked convex geometry ⋮ Dualization in lattices given by implicational bases ⋮ Finding maximal independent elements of products of partial orders (the case of chains)

This page was built for publication: Algorithms for Dualization over Products of Partially Ordered Sets