Pages that link to "Item:Q1183948"
From MaRDI portal
The following pages link to Finding all closed sets: A general approach (Q1183948):
Displaying 18 items.
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Effective approximation of parametrized closure systems over transactional data streams (Q782465) (← links)
- Listing closed sets of strongly accessible set systems with applications to data mining (Q844900) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Finding all closed sets: A general approach (Q1183948) (← links)
- Computing on-line the lattice of maximal antichains of posets (Q1344242) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
- Steps towards causal Formal Concept Analysis (Q2076995) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- Two-Level Polytopes with a Prescribed Facet (Q2835684) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
- Comparing performance of algorithms for generating concept lattices (Q4409026) (← links)
- Tropical Computations in polymake (Q4556580) (← links)
- Efficient algorithms on distributive lattices (Q5936459) (← links)
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7 (Q6040344) (← links)
- Computations with finite closure systems and implications (Q6064021) (← links)
- LinCbO: fast algorithm for computation of the Duquenne-Guigues basis (Q6071284) (← links)
