DMCA
A fast algorithm for building lattices (1999)
by
Lhouari Nourine
,
Olivier Raynaud
| Venue: | Information Processing Letters |
| Citations: | 65 - 0 self |
BibTeX
@ARTICLE{Nourine99afast,
author = {Lhouari Nourine and Olivier Raynaud},
title = {A fast algorithm for building lattices},
journal = {Information Processing Letters},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a simple, efficient algorithm to compute the covering graph of the lattice generated by a family B of subsets of a set X. The implementation of this algorithm has O..jXj C jBj / jBj / time complexity per lattice element. This improves previous algorithms of Bordat (1986), Ganter and Kuznetsov (1998) and Jard et al. (1994). This algorithm can be used to compute the Galois (concept) lattice, the maximal antichains lattice or the Dedekind–MacNeille completion of a partial
