Finding all closed sets: A general approach

DOI10.1007/BF00383449zbMath0754.06003MaRDI QIDQ1183948

Bernhard Ganter, Klaus Reuter

Publication date: 28 June 1992

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

algorithms; closed sets of a closure operator; ideals of a power set; orders of a power set

Mathematics Subject Classification ID

68R99: Discrete mathematics in relation to computer science

06A15: Galois correspondences, closure operators (in relation to ordered sets)

Related Items

Comparing performance of algorithms for generating concept lattices, Tropical Computations in polymake, Efficient algorithms on distributive lattices, On the number of maximal antichains in Boolean lattices for \(n\) up to 7, The joy of implications, aka pure Horn formulas: mainly a survey, Effective approximation of parametrized closure systems over transactional data streams, Listing closed sets of strongly accessible set systems with applications to data mining, Enumeration aspects of maximal cliques and bicliques, Finding all closed sets: A general approach, Computing on-line the lattice of maximal antichains of posets, Enumeration of 2-level polytopes, A depth-first search algorithm for computing pseudo-closed sets, Steps towards causal Formal Concept Analysis, Computing the least common subsumer w.r.t. a background terminology, Two-Level Polytopes with a Prescribed Facet, An Integer Programming Formulation for the Maximum k-Subset Intersection Problem

Cites Work

• Finding all closed sets: A general approach
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations