| Abstract | Discrete structure manipulation is a fundamental technique for many problems solved by computers. BDDs/ZDDs have attracted a great deal of attention
for twenty years, because it efficiently manipulates basic discrete structures such as logic functions and sets of combinations. Recently, one of the most interesting research topics related to BDDs/ZDDs is “frontier-based method,” a very efficient algorithm for enumerating and indexing the subsets of a graph to satisfy a given constraint.
This work is important because many kinds of practical problems can be efficiently solved by some variations of this algorithm. In this article, we present an overview of the frontier-based method and recent topics on the state-of-the-art algorithms to show the power of enumeration. |