Repository | Book | Chapter

COPR BookmarkLink
200467

(2010) Formal concept analysis, Dordrecht, Springer.

About the enumeration algorithms of closed sets

Alain Gély, Raoul Medina, Lhouari Nourine

pp. 1-16

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.

Publication details

DOI: 10.1007/978-3-642-11928-6_1

Full citation:

Gély, A. , Medina, R. , Nourine, L. (2010)., About the enumeration algorithms of closed sets, in L. Kwuida & B. Sertkaya (eds.), Formal concept analysis, Dordrecht, Springer, pp. 1-16.

This document is unfortunately not available for download at the moment.