40 citations · 64 across the 27 of their papers we have counts for
8 papers · 1 filter
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…
ALLSAT compressed with wildcards: An invitation for C-programmers
Marcel Wild
The model set of a general Boolean function in CNF is calculated in a compressed format, using novel wildcards. This method can be explained in very visual ways. Preliminary compar…
An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes
Marcel Wild
Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k+1 element ideal…
Compression with wildcards: All k-models of a binary decision diagram
Marcel Wild, Yves Semegni
Given a Binary Decision Diagram of a Boolean function in variables, it is well known that all -models can be enumerated in output polynomial time, and in a compresse…
Compressed representation of Learning Spaces
Marcel Wild
Learning Spaces are certain set systems that are applied in the mathematical modeling of education. We propose a suitable compression (without loss of information) of such set syst…
Compression with wildcards: All, or all maximum, anticlques of a graph
Marcel Wild
By definition an anticlique is an independent set of vertices of a graph . By duality all results obtained for anticliques carry over to cliques. (It is for technical reasons th…