On the Size of the Zero-Suppressed Binary Decision Diagram that Represents All the Subtrees in a Tree

  • Norihito Yasuda
  • Masaaki Nishino
  • Shin-ichi Minato
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8643)

Abstract

This paper presents a method of constructing a ZDD that represents all connected subtrees in the given tree and analyzes the size of the resulting ZDD. We show that the size of the ZDD is bounded by \(O(nh)\) for a tree with \(n\)-nodes and \(h\)-height. Furthermore, by properly ordering the ZDD variables, we can further reduce the size to \(O(n\log n)\), which is surprisingly small compared to represent at most \(O(2^n)\) subtrees.

References

  1. 1.
    Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 100(8), 677–691 (1986)CrossRefGoogle Scholar
  2. 2.
    Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms Part 1, vol. 4A. Addison-Wesley, Upper Saddle River (2011)Google Scholar
  3. 3.
    Sekine, K., Imai, H., Tani, S.: Computing the tutte polynomial of a graph of moderate size. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 224–233. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  4. 4.
    Sekine, K.: Counting the number of paths in a graph via bdds. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 80(4), 682–688 (1997)Google Scholar
  5. 5.
    Gagie, T., Hermelin, D., Landau, G.M., Weimann, O.: Binary jumbled pattern matching on trees and tree-like structures. arXiv preprint arXiv:1301.6127 (2013)

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Norihito Yasuda
    • 1
  • Masaaki Nishino
    • 2
  • Shin-ichi Minato
    • 1
    • 3
  1. 1.JST ERATO Minato Discrete Structure Manipulation System ProjectSapporoJapan
  2. 2.NTT Communication Science LaboratoriesKyotoJapan
  3. 3.Hokkaido UniversitySapporoJapan

Personalised recommendations