Properties of /spl Delta/-trees and their relationship with peripheral trees
Macii · 1994
/spl Delta/-trees of a graph have been introduced in the recent past for applications in the areas of logic synthesis and formal hardware verification together with an algorithm for their determination. We focus on the theory of /spl Delta/-trees; in particular, we illustrate the fundamental properties of this new kind of tree, and we study its relationship with peripheral trees.>