Representing a concept lattice by a graph - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2004

Representing a concept lattice by a graph

Anne Berry
  • Fonction : Auteur
  • PersonId : 841471

Résumé

Concept lattices (also called Galois lattices) are an ordering of the maximal rectangles defined by a binary relation. In this paper, we present a new relationship between lattices and graphs: given a binary relation R, we define an underlying graph G_R, and establish a one-to-one correspondence between the set of elements of the concept lattice of R and the set of minimal separators of G_R. We explain how to use the properties of minimal separators to define a sublattice, decompose a binary relation, and generate the elements of the lattice.
Fichier non déposé

Dates et versions

hal-00521923 , version 1 (29-09-2010)

Identifiants

  • HAL Id : hal-00521923 , version 1

Citer

Anne Berry, Alain Sigayret. Representing a concept lattice by a graph. Discrete Applied Mathematics, 2004, 144 (1-2), pp 27-42. ⟨hal-00521923⟩
61 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More