A fast incremental algorithm for building lattices
From MaRDI portal
Publication:4409027
DOI10.1080/09528130210164152zbMath1022.68027MaRDI QIDQ4409027
Lhouari Nourine, Olivier Raynaud
Publication date: 28 October 2003
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09528130210164152
Related Items
On Independent Sets and Bicliques in Graphs, Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs, Enumeration aspects of maximal cliques and bicliques, Basic theorem as representation of heterogeneous concept lattices, Contribution to attributive and object subcontexts in inferring good maximally redundant tests, On independent sets and bicliques in graphs, Mining Triadic Association Rules from Ternary Relations
Cites Work
- Computing on-line the lattice of maximal antichains of posets
- Tree structure for distributive lattices and its applications
- A fast algorithm for building lattices
- Two Basic Algorithms in Concept Analysis
- The Diclique Representation and Decomposition of Binary Relations
- Efficient algorithms on distributive lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item