On the Size of the Zero-Suppressed Binary Decision Diagram that Represents All the Subtrees in a Tree
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.
- 2.Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms Part 1, vol. 4A. Addison-Wesley, Upper Saddle River (2011)Google Scholar
- 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.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)