Efficient enumeration of solutions produced by closure operations

zbMATH Open1417.05010arXiv1712.03714MaRDI QIDQ5226843FDOQ5226843

Authors: Arnaud Mary, Yann Strozecki 

Publication date: 1 August 2019

Full work available at URL: https://arxiv.org/abs/1712.03714

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

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)

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
• Generation problems
• Mathematical Foundations of Computer Science 2004
• Title not available (Why is that?)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• 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)