Efficient enumeration of solutions produced by closure operations

MaRDI QIDQ5226843zbMATH OpenFDO

Authors Arnaud Mary, Yann Strozecki

Publication date 1 August 2019

Full work available at URL https://arxiv.org/abs/1712.03714, https://dmtcs.episciences.org/5549/pdf

zbMATH Keywords

enumerationmaximal independent setspolynomial delayPost's latticeincremental polynomial timeset saturation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 6829393
• About the enumeration algorithms of closed sets
• Publication:3204513
• Formal Concept Analysis
• Mathematical Foundations of Computer Science 2004

Cited in

(15)

• Enumerating models of DNF faster: breaking the dependency on the formula size
• Maximal strongly connected cliques in directed graphs: algorithms and bounds
• On the complexity of solution extension of optimization problems
• Generating clause sequences of a CNF formula
• scientific article; zbMATH DE number 7204563 (Why is no real title available?)
• scientific article; zbMATH DE number 4181405 (Why is no real title available?)
• Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
• Generation problems
• Mathematical Foundations of Computer Science 2004
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• scientific article; zbMATH DE number 6829393 (Why is no real title available?)
• Formal Concept Analysis
• Efficient Enumeration of Distinct Factors Using Package Representations
• Polynomial-delay enumeration algorithms in set systems
• About the enumeration algorithms of closed sets

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)