| Summary: | 博士 === 國立交通大學 === 資訊工程研究所 === 84 === The embedding problem has been widely discussed in recent
years. In this dissertation, we study embedding of various
guest graphs such as complete binary trees, incomplete binary
trees, tree machines and quadtrees into host graphs such as
hypercubes and incomplete hypercubes. We also study dynamic
reconfiguration of complete binary trees in faulty hypercubes.
First, we embed a complete binary tree into an incomplete
hypercube of the smallest size so that the adjacency of the
complete binary tree is preserved, and look for an incomplete
binary tree in a hypercube. Second, we optimally embed a large
complete binary tree into a hypercube of limited size. Third,
we embed a tree machine into an incomplete hypercube with
expansion 1, and embed a large tree machine into a hypercube of
limited size with load-balance. Fourth, we embed a quadtree
into a hypercube so that the adjacency of the quadtree is
preserved, and embed a quadtree into an incomplete hypercube
with expansion 1. Fifth, we dynamically reconfigure to embed a
complete binary tree into a faulty hypercube, and the number of
the affected nodes of the complete binary tree are as few as
possible after reconfiguring.
|
|---|
