Abstract. Binary decision diagrams have been shown as a powerful
paradigm in handling Boolean functions and have been applied to many
fields such as VLSI CAD, AI, combinatorics, etc. This paper proposes
a new operation on an ordered binary decision diagram (OBDD), called
reordering, and demonstrates its usefulness with presenting an extended
algorithmic framework of applying OBDDs to combinatorial graph enu-
meration problems.