Binary decision diagram with minimum expected path length

• DOI: 10.5555/367072.367858
• Publication Date: 2001-03-13
• Authors: Yiyu Liu; Kuo‐Hua Wang; TingTing Hwang; C.L. Liu
• Keywords: Binary decision diagram; Traverse; Path length; Boolean network; Representation

We present methods to generate a Binary Decision Diagram (BDD) with minimum expected path length. A BDD is generic data structure which widely used in several fields. One important application the representation of Boolean functions. enables us evaluate function: Simply traverse from root node terminal and retrieve value node. For length will be also minimized evaluation time for corresponding function. Three efficient algorithms constructing BDDs are proposed.