Abstract
Binary decision diagrarms 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 enumeration problems.
Cite
CITATION STYLE
Tani, S., & Imai, H. (1994). A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 575–583). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_225
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
