On generating all maximal independent sets
Information Processing Letters
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
A Survey of Combinatorial Gray Codes
SIAM Review
A fast algorithm for building lattices
Information Processing Letters
New Results on Monotone Dualization and Generating Hypergraph Transversals
SIAM Journal on Computing
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Maximal and stochastic Galois lattices
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
Some decision and counting problems of the Duquenne-Guigues basis of implications
Discrete Applied Mathematics
Enumeration aspects of maximal cliques and bicliques
Discrete Applied Mathematics
Some Computational Problems Related to Pseudo-intents
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Very fast instances for concept generation
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
| Hi-index | 0.00 |
This paper presents a review of enumeration technics used for the generation of closed sets. A link is made between classical enumeration algorithms of objects in graphs and algorithms for the enumeration of closed sets. A unified framework, the transition graph, is presented. It allows to better explain the behavior of the enumeration algorithms and to compare them independently of the data structures they use.