40 citations · 64 across the 27 of their papers we have counts for
29 papers
Enumerating all minimal hitting sets in polynomial total time
Marcel Wild
Consider a hypergraph (=set system) whose hyperedges are subsets of a set with w elements. We show that the minimal hitting sets of can be enumera…
Modular lattices of finite length (Part A)
Marcel Wild
This is Part A of four Parts dedicated to modular lattices of finite length. It builds on 1992 notes of the author (available on ResearchGate), and in so doing heeds a wish of the…
Compression with wildcards: All exact, or all minimal hitting sets
Marcel Wild
Our main objective is the COMPRESSED enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs. To the author's best knowledge the only previous attempt t…
Compression with wildcards: All spanning trees with prescribed vertex-degrees
Marcel Wild
By processing all minimal cutsets of a graph G, and by using novel wildcards, all spanning trees of G can be compactly encoded. Surprisingly, a 1986 algorithm of Winter seems to ac…
ALLSAT compressed with wildcards: Frequent Set Mining
Marcel Wild
Like any simplicial complex the simplicial complex of all frequent sets can be compressed with wildcards once the maximal frequent sets (=facets) are known. Namely, the task (a par…
Compression with wildcards: Abstract simplicial complexes
Marcel Wild
Despite the more handy terminology of abstract simplicial complexes SC, in its core this article is about antitone Boolean functions. Given the maximal faces (=facets) of SC, our m…