DOI Publisher
ElsevierAbstract
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercube on a one-to-one basis with dilation at most 5.[[fileno]]2030233010010[[department]]資訊工程學
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercube on a one-to-one basis with dilation at most 5.[[fileno]]2030233010010[[department]]資訊工程學
We return to the problem of embedding 2-dimensional (h × w ) guest grid graphs into 2dimensional (h...
We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its opt...
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its opt...
We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercu...
The hypercube is a particularly versatile network for parallel computing. It is wellknown that 2-dim...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
This paper parallelizes the embedding strategy for mapping any two-dimensional grid into its optimal...
We consider one-to-one embeddings of the n-dimensional hypercube into grids with 2 n vertices and ...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
Abstract: Möbius cubes are an important class of hypercube variants. This paper addresses how to em...
Let G be a graph, and denote by Q(G)/2t the hypercube of dimension log2|G|-t. Motivated by the probl...
Graph embedding problems have gained importance in the field of interconnection networks for paralle...
In this paper we study the problem of how to efficiently embed r intercon-nection networks Go,...,Gr...
We return to the problem of embedding 2-dimensional (h × w ) guest grid graphs into 2dimensional (h...
We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its opt...
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its opt...
We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercu...
The hypercube is a particularly versatile network for parallel computing. It is wellknown that 2-dim...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
This paper parallelizes the embedding strategy for mapping any two-dimensional grid into its optimal...
We consider one-to-one embeddings of the n-dimensional hypercube into grids with 2 n vertices and ...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
Abstract: Möbius cubes are an important class of hypercube variants. This paper addresses how to em...
Let G be a graph, and denote by Q(G)/2t the hypercube of dimension log2|G|-t. Motivated by the probl...
Graph embedding problems have gained importance in the field of interconnection networks for paralle...
In this paper we study the problem of how to efficiently embed r intercon-nection networks Go,...,Gr...
We return to the problem of embedding 2-dimensional (h × w ) guest grid graphs into 2dimensional (h...
We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
Add to ORKG