A General Framework for Parallel Unary Operations on ZDDs

  • Shogo Takeuchi
  • Takahisa Toda
  • Shin-ichi Minato
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8643)


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.


Parallelization Zero-suppressed binary decision diagram Compression 


  1. 1.
    Coudert, O.: Solving graph optimization problems with ZBDDs. In: The 1997 European Conference on Design and Test, Paris, France, pp. 224–228, March 1997Google Scholar
  2. 2.
    Knuth, D.: The Art of Computer Programming, vol. 4a. Addison-Wesley Professional, New Jersey (2011)Google Scholar
  3. 3.
    Sekine, K., Imai, H.: Counting the number of paths in a graph via BDDs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E80-A, 682–688 (1997)Google Scholar
  4. 4.
    Hardy, G., Lucet, C., Limnios, N.: K-terminal network reliability measures with binary decision diagrams. IEEE Trans. Reliab. 56(3), 506–515 (2007)CrossRefGoogle Scholar
  5. 5.
    Inoue, T., Takano, K., Watanabe, T., Kawahara, J., Yoshinaka, R., Kishimoto, A., Tsuda, K., Minato, S.I., Hayashi, Y.: Distribution loss minimization with guaranteed error bound. IEEE Trans. Smart Grid 5(1), 102–111 (2014)CrossRefGoogle Scholar
  6. 6.
    Minato, S., Arimura, H.: Frequent closed item set mining based on zero-suppressed BDDs. Trans. Jpn. Soc. Artif. Intell. 22, 165–172 (2007)CrossRefGoogle Scholar
  7. 7.
    Minato, S., Arimura, H.: Frequent pattern mining and knowledge indexing based on zero-suppressed BDDs. In: Džeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol. 4747, pp. 152–169. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Minato, S., Uno, T., Arimura, H.: LCM over ZBDDs: fast generation of very large-scale frequent itemsets using a compact graph-based representation. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 234–246. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  9. 9.
    Loekito, E., Bailey, J., Pei, J.: A binary decision diagram based approach for mining frequent subsequences. Knowl. Inf. Syst. 24(2), 235–268 (2010)CrossRefGoogle Scholar
  10. 10.
    van Dijk, T., Laarman, A., van de Pol, J.: Multi-core BDD operations for symbolic reachability. Electron. Notes Theor. Comput. Sci. 296, 127–143 (2013)CrossRefGoogle Scholar
  11. 11.
    Elbayoumi, M., Hsiao, M.S., ElNainay, M.: A novel concurrent cache-friendly binary decision diagram construction for multi-core platforms. In: Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1427–1430, March 2013Google Scholar
  12. 12.
    Toda, T.: Hypergraph transversal computation with binary decision diagrams. In: 12th International Symposium on Experimental Algorithms, Rome, Italy, June 2013Google Scholar
  13. 13.
    Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th ACM/IEEE Design Autiomation Conference (DAC-93), Dallas, Texas, USA, pp. 272–277, Jun 1993Google Scholar
  14. 14.
    Schröer, O., Wegener, I.: The theory of zero-suppressed BDDs and the number of knight’s tours. Formal Meth. Syst. Des. 13(3), 235–253 (1998)CrossRefGoogle Scholar
  15. 15.
    Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Shogo Takeuchi
    • 1
  • Takahisa Toda
    • 2
  • Shin-ichi Minato
    • 1
    • 3
  1. 1.ERATO MINATO Discrete Structure Manipulation System Project, Japan Science and Technology AgencyHokkaido UniversitySapporoJapan
  2. 2.Graduate School of Information SystemsThe University of Electro-CommunicationsChofuJapan
  3. 3.Graduate School of Information Science and TechnologyHokkaido UniversitySapporoJapan

Personalised recommendations