A Linear Delay Algorithm for Building Concept Lattices
From MaRDI portal
Publication:3506954
DOI10.1007/978-3-540-69068-9_20zbMath1143.68602OpenAlexW1506120262MaRDI QIDQ3506954
Yang Huang, Martín Farach-Colton
Publication date: 17 June 2008
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_20
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Knowledge representation (68T30) Complete lattices, completions (06B23)
Related Items (2)
Constructing L-fuzzy concept lattices without fuzzy Galois closure operation ⋮ A convexity upper bound for the number of maximal bicliques of a bipartite graph
This page was built for publication: A Linear Delay Algorithm for Building Concept Lattices