Abstract
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. © Springer-Verlag Berlin Heidelberg 2010.
Cite
CITATION STYLE
Ǵely, A., Medina, R., & Nourine, L. (2010). About the enumeration algorithms of closed sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5986 LNAI, pp. 1–16). https://doi.org/10.1007/978-3-642-11928-6_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
