Learn More
2 Abstract Let T h be the complete binary tree of height h. Let M be the infinite grid graph with vertex set Z 2 , where two vertices (x 1 ,y 1) and (x 2 ,y 2) of M are adjacent if and only if |x 1-x 2 | + |y 1-y 2 | = 1. Suppose that T is a tree which is a subdivision of T h and is also isomorphic to a subgraph of M. Motivated by issues in optimal VLSI(More)
  • 1