HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

Zero-suppressed BDDs and their applications

Files in This Item:
IJSTTT3-2.pdf340.22 kBPDFView/Open
Please use this identifier to cite or link to this item:

Title: Zero-suppressed BDDs and their applications
Authors: Minato, Shin-ichi Browse this author →KAKEN DB
Keywords: BDD
Boolean function
Combinatorial problem
Issue Date: May-2001
Publisher: Springer Berlin / Heidelberg
Journal Title: International Journal on Software Tools for Technology Transfer
Volume: 3
Issue: 2
Start Page: 156
End Page: 170
Abstract: In many real-life problems, we are often faced with manipulating sets of combinations. In this article, we study a special type of ordered binary decision diagram (OBDD), called zero-suppressed BDDs (ZBDDs). This data structure represents sets of combinations more efficiently than using original OBDDs. We discuss the basic data structures and algorithms for manipulating ZBDDs in contrast with the original OBDDs. We also present some practical applications of ZBDDs, such as solving combinatorial problems with unate cube set algebra, logic synthesis methods, Petri net processing, etc. We show that a ZBDD is a useful option in OBDD techniques, suitable for a part of the practical applications.
Rights: The original publication is available at
Type: article (author version)
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 湊 真一

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 - Hokkaido University