Add to ORKGA new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented
We propose a general strategy of many-to-one embedding of treerelated graphs into hypercubes. These ...
Abs-t- We study the problem of running full binary tree based algorithms on a hypercube with faulty ...
AbstractA lot of research has been devoted to finding efficient embedding of trees into hypercubes. ...
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a n...
The double-rooted complete binary tree is a complete binary tree where the root is replaced by an ed...
[[abstract]]©1992 Institute of Information Science Academia Sinica-Many-to-one embeddings of large b...
The problem of embedding a guest graph G into a host graph H arises in the process of mapping a para...
AbstractThe solution of large sparse positive definite systems of equations typically involves four ...
From the hardware and software points of view, the double-rooted binary tree (DRBT) structure is ver...
[[abstract]]The commercial hypercube-based machine is a good physical architecture for embedding var...
This dissertation contains work on three main topics. Chapters 1 through 4 provide complexity result...
AbstractWe describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the ...
We describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the followin...
AbstractThe purpose of this paper is to describe a method for embedding binary trees into hypercubes...
We show that the complete binary tree with n > 8 leaves can be embedded in the hypercube with n node...
We propose a general strategy of many-to-one embedding of treerelated graphs into hypercubes. These ...
Abs-t- We study the problem of running full binary tree based algorithms on a hypercube with faulty ...
AbstractA lot of research has been devoted to finding efficient embedding of trees into hypercubes. ...
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a n...
The double-rooted complete binary tree is a complete binary tree where the root is replaced by an ed...
[[abstract]]©1992 Institute of Information Science Academia Sinica-Many-to-one embeddings of large b...
The problem of embedding a guest graph G into a host graph H arises in the process of mapping a para...
AbstractThe solution of large sparse positive definite systems of equations typically involves four ...
From the hardware and software points of view, the double-rooted binary tree (DRBT) structure is ver...
[[abstract]]The commercial hypercube-based machine is a good physical architecture for embedding var...
This dissertation contains work on three main topics. Chapters 1 through 4 provide complexity result...
AbstractWe describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the ...
We describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the followin...
AbstractThe purpose of this paper is to describe a method for embedding binary trees into hypercubes...
We show that the complete binary tree with n > 8 leaves can be embedded in the hypercube with n node...
We propose a general strategy of many-to-one embedding of treerelated graphs into hypercubes. These ...
Abs-t- We study the problem of running full binary tree based algorithms on a hypercube with faulty ...
AbstractA lot of research has been devoted to finding efficient embedding of trees into hypercubes. ...