Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

Add code
Dec 03, 2010
José L. Balcázar, Cristina Tîrnăucă
Figure 1 for Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
Figure 2 for Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
Figure 3 for Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
Figure 4 for Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

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.

View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon