Counting by ZDD

Years and Authors of Summarized Original Work

• 1986; R. E. Bryant

• 1993; S. Minato

• 2009; D. E. Knuth

• 2013; S. Minato

• 2013; T. Inoue, H. Iwashita, J. Kawahara, S. Minato

Problem Definition

We consider a framework of the problems to enumerate all the subsets of a given graph, each subset of which satisfies a given constraint. For example, enumerating all Hamilton cycles, all spanning trees, all paths between two vertices, all independent sets of vertices, etc. When we assume a graph G = (V, E) with the vertex set V = { v₁, v₂, …, v _n } and the edge set E = { e₁, e₂, …, e _m }, a graph enumeration problem is to compute a subset of the power set 2^E (or 2^V), each element of which satisfies a given constraint. In this model, we can consider that each solution is a combination of edges (or vertices), and the problem is how to represent the set of solutions and how to generate it efficiently.

Constraints

Any kind of constraint for the graph edges and vertices can be considered. For example, we...