Graph-Pair Decision Diagram

Abstract

In Chap. 3 we introduced a technique to formulate the spanning-tree enumeration problem into a BDD construction problem. The BDD-based tree enumerationBDD-based tree enumeration does not go through all spanning trees explicitly because the sharable subtrees are not enumerated twice. Therefore, the BDD-based tree-enumeration is truly an implicit enumeration Implicit enumeration strategy. In contrast, by explicit enumeration Explicit enumeration we mean that all the necessary symbolic product terms are enumerated one after another exhaustively. The benefit of implicit enumeration has already been demonstrated by an implementation of the DDD algorithm in Chap. 4. The main task of this chapter is to present another BDD-based implementation strategy for enumerating all admissible two-trees for any given linear network. This chapter is a continuation of the previous chapter by emphasizing the computer implementation issues of the enumeration rules developed there.