Zero-suppressed BDDs for set manipulation in combinatorial problems
Shin-ichi Minato · 1993
In this paper, we propose Zero-Suppressed BDDs (O-Sup-BDDs), which are BDDs based on a new reduction rule.This data structure brings unique and compact representation of sets which appear in many combinatorial problems.Using O-SUP-BDDS, we can manipulate such sets more simply and efficiently than using original BDDs.We show the properties of O-Sup-BDDs, their manipulation algorithms, snd good applications for LSI CAD systems.