About the Enumeration Algorithms of Closed Sets

DOI10.1007/978-3-642-11928-6_1zbMath1274.68672OpenAlexW1551162755MaRDI QIDQ3552276

Lhouari Nourine, Raoul Median, Alain Gély

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) Partitions of sets (05A18) Nonnumerical algorithms (68W05) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: About the Enumeration Algorithms of Closed Sets