Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice

Résumé

Galois sub-hierarchies have been introduced as an interesting polynomial-size sub-order of a concept lattice, with useful applications. We present an algorithm which, given a context, efficiently computes an ordered partition which corresponds to a linear extension of this sub-hierarchy.
Fichier non déposé

Dates et versions

hal-00522381 , version 1 (30-09-2010)

Identifiants

  • HAL Id : hal-00522381 , version 1

Citer

Anne Berry, Marianne Huchard, Ross M. Mc Connell, Alain Sigayret, Jeremy P. Spinrad. Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. Third International Conference on Formal Concept Analysis, Feb 2005, Lens, France. pp 208-222. ⟨hal-00522381⟩
129 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More