Decompositional approach to research of formal contexts
From MaRDI portal
(Redirected from Publication:5151269)
Recommendations
Cites work
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- Bicliques in graphs. I: Bounds on their number
- Comparing performance of algorithms for generating concept lattices
- Conceptual exploration
- Discrete analysis of feature descriptions in recognition problems of high dimensionality
- Generating bicliques of a graph in lexicographic order
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 877297 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 2210663 (Why is no real title available?)
- Infinitesimal deformations of harmonic maps
- On cliques in graphs
- Ordered sets
- The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
Cited in
(9)- Computing formal concepts by attribute sorting
- Handling Large Formal Context Using BDD – Perspectives and Limitations
- Formal concept analysis via atomic priming
- Efficient approximation for counting of formal concepts generated from formal context
- Breadth first search graph partitions and concept lattices
- On the Merge of Factor Canonical Bases
- On Decomposition of a Binary Context Without Losing Formal Concepts
- Doubly-lexical order supports standardisation and recursive partitioning of formal context
- Formal Independence Analysis
This page was built for publication: Decompositional approach to research of formal contexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151269)