AI Chat AI Image Generator AI Video Text to Speech

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

12/03/2010

∙

by José L. Balcázar, et al.

∙

∙

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.

José L. Balcázar
4 publications
Cristina Tîrnăucă
2 publications

research

∙ 09/22/2022

Process Diagrams

This paper is simply a collection of process diagrams for further use an...

0 Sheelagh Carpendale, et al. ∙

research

∙ 02/23/2022

Lattice path matroids and quotients

We characterize the quotients among lattice path matroids (LPMs) in term...

0 Carolina Benedetti, et al. ∙

research

∙ 04/20/2020

Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams

While the standard unweighted Voronoi diagram in the plane has linear wo...

0 Chenglin Fan, et al. ∙

research

∙ 05/01/2023

Data-Parallel Algorithms for String Diagrams

We give parallel algorithms for string diagrams represented as structure...

0 Paul Wilson, et al. ∙

research

∙ 12/24/2015

Computing Chebyshev knot diagrams

A Chebyshev curve C(a,b,c,ϕ) has a parametrization of the form x(t)=T_a(...

0 P. -V Koseleff, et al. ∙

research

∙ 02/01/2022

Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures

Epiphainein counts unreachable single-side pawn diagrams (in chess) wher...

0 Colin McDonagh, et al. ∙

research

∙ 10/21/2022

An Approach to Build Consistent Software Architecture Diagrams Using Devops System Descriptors

System architecture diagrams play an essential role in understanding sys...

0 Jalves Nicacio, et al. ∙