• Citations Per Year
Learn More
Let Th be the complete binary tree of height h. Let M be the infinite grid graph with vertex<lb>set Z, where two vertices (x1,y1) and (x2,y2) of M are adjacent if and only if<lb>|x1-x2| + |y1-y2| = 1. Suppose that T is a tree which is a subdivision of Th and is also isomorphic<lb>to a subgraph of M. Motivated by issues in optimal VLSI design, we show that(More)
  • 1