40 citations · 64 across the 27 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
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…
cs.DS2020
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…