40 citations · 64 across the 27 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012
Compression with wildcards: All models of a Boolean 2-CNF
Marcel Wild
Let be a finite set which simultaneously serves as the universe of any poset and as the vertex set of any graph . Our algorithm, abbreviated A-I-I, enumerates…
math.CO2012
Output polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree
Marcel Wild
The N cardinality k ideals of any w-element poset (w, k variable) can be enumerated in time O(Nw^3). The corresponding bound for k-element subtrees of a w-element tree is O(Nw^5).…