Paper Info
Title
A General Framework for Parallel Unary Operations on ZDDs.
Abstract
A zero-suppressed binary decision diagram is a compressed data structure that represents families of sets. There are various basic operations to manipulate families of sets over ZDDs such as union, intersection, and difference. They can be efficiently computed without decompressing ZDDs. Among them, there are many important unary operations such as computing the ZDD for all extremal sets ( maximal sets or minimal sets) from an input ZDD. Unary operations are useful in various fields such as constraint programming, data mining, and artificial intelligence. Therefore, they must be efficiently computed. In this paper, we propose a general framework for parallel unary operations on ZDDs. We analyze the computational complexity and evaluate the effectiveness of our method by performing computational experiments.
Year
DOI
Venue
2014
10.1007/978-3-319-13186-3_44
Lecture Notes in Artificial Intelligence
Keywords
DocType
Volume
Parallelization,Zero-suppressed binary decision diagram,Compression
Conference
8643
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
12
3
Name
Order
Citations
PageRank
Shogo Takeuchi100.34
Takahisa Toda2113.53
Shin-ichi Minato372584.72