The number of Moore families on n=6
From MaRDI portal
Publication:1781981
Recommendations
- Algorithms for counting Moore families: application to the case \(n=7\)
- Counting of Moore families for \(n=7\)
- Generation of union-closed sets and Moore families
- Recursive decomposition and bounds of the lattice of Moore co-families.
- Recursive decomposition tree of a Moore co-family and closure algorithm.
Cites work
Cited in
(12)- Representation of lattices via set-colored posets
- Counting of Moore families for \(n=7\)
- Recursive decomposition tree of a Moore co-family and closure algorithm.
- Recursive decomposition and bounds of the lattice of Moore co-families.
- On the lattice of conceptual measurements
- Generation of union-closed sets and Moore families
- Enumeration of closed families of finite sets
- On critical sets of a finite Moore family
- Algorithms for \(k\)-meet-semidistributive lattices
- Succinctness and tractability of closure operator representations
- On-line algorithms for orders
- Algorithms for counting Moore families: application to the case \(n=7\)
This page was built for publication: The number of Moore families on \(n=6\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781981)