Dualization of a monotone Boolean function represented by a conjunctive normal form
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …

The problem of enumerating (ie, generating) all maximal cliques in a graph has received
extensive treatment, due to the plethora of applications in various areas such as data …

arXiv:1605.05102v2 [cs.DS] 25 May 2016 Page 1 arXiv:1605.05102v2 [cs.DS] 25 May 2016
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …

We show that all minimal dominating sets of a chordal bipartite graph can be generated in
incremental polynomial, hence output polynomial, time. Enumeration of minimal dominating …

We show that all minimal edge dominating sets of a graph can be generated in incremental
polynomial time. We present an algorithm that solves the equivalent problem of enumerating …

In 1994 Fredman and Khachiyan established the remarkable result that the duality of a pair
of monotone Boolean functions, in disjunctive normal forms, can be tested in quasi …

We prove that line graphs and path graphs have bounded neighbourhood Helly. As a
consequence, we obtain output-polynomial time algorithms for enumerating the set of …

We consider the problem of finding all minimal transversals of a hypergraph H⊆ 2V, given
by an explicit list of its hyperedges. We give a new decomposition technique for solving the …

We consider the problem of finding all minimal transversals of a hypergraph
\mathcalH⊆2^V, given by an explicit list of its hyperedges. We give a new decomposition …

The well-known vertex enumeration problem calls for generating all vertices of a
polyhedron, given by its description as a system of linear inequalities. Recently, a number of …