On the dualization in distributive lattices and related problems
From MaRDI portal
Publication:2030249
DOI10.1016/j.dam.2021.04.018OpenAlexW3164495475MaRDI QIDQ2030249
Oscar Defrain, Takeaki Uno, Lhouari Nourine
Publication date: 7 June 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.07004
dominating setshypergraph transversalsdistributive lattice dualizationideal enumerationneighborhood inclusion posets
Algorithms in computer science (68Wxx) Artificial intelligence (68Txx) Ordered sets (06Axx) Boolean algebras (Boolean rings) (06Exx) Lattices (06Bxx)
Related Items (2)
On Dualization over Distributive Lattices ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Dualization in lattices given by ordered sets of irreducibles
- Enumerating minimal dominating sets in chordal bipartite graphs
- Computational aspects of monotone dualization: a brief survey
- Linear delay enumeration and monadic second-order logic
- On generating all maximal independent sets
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
- Complexity of learning in concept lattices from positive and negative examples
- A complexity theory for hard enumeration problems
- Extended dualization: application to maximal pattern mining
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
- Lattice Theory: Foundation
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
- Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
- Algorithms for Dualization over Products of Partially Ordered Sets
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Dualization in lattices given by implicational bases
This page was built for publication: On the dualization in distributive lattices and related problems
