Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
José L. Balcázar, Cristina Tîrnȃucȃ · arXiv (Cornell University) · 2010
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.