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

algorithmsclosed sets of a closure operatorideals of a power setorders of a power set

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (19)

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

Cites Work

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

This page was built for publication: Finding all closed sets: A general approach