A Fast Algorithm for Building Lattices


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((|X| + |B|) · |B|) time complexity per lattice element. This improves previous algorithms of Bordat (1986), Ganter and Kuznetsov (1998) and Jard et al. (1994). This algorithm… (More)
DOI: 10.1016/S0020-0190(99)00108-8


2 Figures and Tables

Slides referencing similar topics