About the enumeration algorithms of closed sets

DOI10.1007/978-3-642-11928-6_1MaRDI QIDQ3552276zbMATH OpenOpenAlexFDO

Authors Alain Gély, Raoul Medina, Lhouari Nourine

Publication date 14 April 2010

Published in Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11928-6_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Partitions of sets (05A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)

Recommendations

• Formal Concept Analysis
• Efficient enumeration of solutions produced by closure operations
• scientific article; zbMATH DE number 6829393
• Some complexity results about essential closed sets
• Finding all closed sets: A general approach

Cited in

(6)

• An algorithm for enumerating difference sets
• scientific article; zbMATH DE number 6829393 (Why is no real title available?)
• Formal Concept Analysis
• Finding all closed sets: A general approach
• A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets
• Efficient enumeration of solutions produced by closure operations

This page was built for publication: About the enumeration algorithms of closed sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552276)