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.