Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

DOI10.1007/978-3-642-20514-9_6zbMath1327.06006arXiv1012.0742OpenAlexW1529187200MaRDI QIDQ3003408

José L. Balcázar, Cristina Tîrnăucă

Publication date: 27 May 2011

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.0742

zbMATH Keywords

algorithmslatticesHasse diagrams

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Structure theory of lattices (06B05)

Related Items (2)

Partially ordered sets and stratification ⋮ Computing triadic generators and association rules from triadic contexts

Cites Work

• A fast algorithm for building lattices
• Formal concept analysis. 6th international conference, ICFCA 2008, Montreal, Canada, February 25--28, 2008. Proceedings
• Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
• Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
• Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit
• A Formal Context for Symmetric Dependencies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices