Zero-suppressed binary decision diagram (ZDD) is a compressed data structure for representing a family set. Algorithms that enumerate subgraphs such as paths and spanning trees of a given graph and construct ZDDs representing them are known. Moreover, algorithms that construct ZDDs for chordal subgraphs, interval subgraphs, planar subgraphs, and so on, have been proposed. We can apply constructed ZDDs to various applications including hotspot detection, electral districting and pencil puzzle solvers. In this talk, features of ZDDs and recent research on enumeration of subgraphs using ZDDs are introduced.
