A fast incremental algorithm for building lattices

@article{Nourine2002AFI,
  title={A fast incremental algorithm for building lattices},
  author={Lhouari Nourine and O. Raynaud},
  journal={Journal of Experimental \& Theoretical Artificial Intelligence},
  year={2002},
  volume={14},
  pages={217 - 227}
}
This paper presents an incremental algorithm to compute the covering graph of the lattice generated by a family B of subsets of a totally ordered set X. The implementation of this algorithm has O (((|X| + |B|).|B|).|F|) time complexity, where F is the number of elements in the lattice. This improves the complexity of the previous algorithms which is roughly in O(Min(|X|, |B|)3.|F|). This algorithm may be used in many applications in computer sciences such as the computations of Galois (concept… Expand
Faster Algorithms for Constructing a Concept (Galois) Lattice
  • V. Choi
  • Mathematics, Computer Science
  • ArXiv
  • 2006
Lattice Completion Algorithms for Distributed Computations
Enumeration aspects of maximal cliques and bicliques
On Independent Sets and Bicliques in Graphs
On Independent Sets and Bicliques in Graphs
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
A Fast Algorithm for Building Lattices
Efficient algorithms on distributive lattices
INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES
Tree Structure for Distributive Lattices and its Applications
Computing on-line the lattice of maximal antichains of posets
A lattice conceptual clustering system and its application to browsing retrieval
Comparing performance of algorithms for generating concept lattices
An Introduction to Lattices and Order
The Diclique Representation and Decomposition of Binary Relations
...
1
2
...