A fast incremental algorithm for building lattices (Q4409027): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5609474 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two Basic Algorithms in Concept Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4218274 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient algorithms on distributive lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tree structure for distributive lattices and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing on-line the lattice of maximal antichains of posets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Diclique Representation and Decomposition of Binary Relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for building lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4230685 / rank | |||
Normal rank |
Latest revision as of 18:07, 5 June 2024
scientific article; zbMATH DE number 1941963
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast incremental algorithm for building lattices |
scientific article; zbMATH DE number 1941963 |
Statements
A fast incremental algorithm for building lattices (English)
0 references
28 October 2003
0 references
incremental algorithm
0 references
covering graph
0 references