Efficient enumeration of solutions produced by closure operations
From MaRDI portal
Recommendations
Cited in
(23)- Enumerating models of DNF faster: breaking the dependency on the formula size
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- On the complexity of solution extension of optimization problems
- Generating clause sequences of a CNF formula
- Generation problems
- scientific article; zbMATH DE number 4181405 (Why is no real title available?)
- About the enumeration algorithms of closed sets
- scientific article; zbMATH DE number 6829393 (Why is no real title available?)
- scientific article; zbMATH DE number 7204563 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2004
- Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
- Formal Concept Analysis
- Polynomial-delay enumeration algorithms in set systems
- Efficient Enumeration of Distinct Factors Using Package Representations
- Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
- Enumerating minimal solution sets for metric graph problems
- On the B-differential of the componentwise minimum of two affine vector functions
- Roman hitting functions
- On the enumeration of signatures of XOR-CNF's
- From amortized to worst case delay in enumeration algorithms
- Enumerating spanners in directed temporal graphs
- Enumerating the irreducible closed sets of an acyclic implicational base of bounded degree
This page was built for publication: Efficient enumeration of solutions produced by closure operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226843)
