AbstractWe prove exact results on dilations in cycles for important parallel computer interconnection networks such as complete trees, hypercubes, and 2- and 3- dimensional meshes. Moreover, we show that trees, X-trees, n-dimensional meshes, pyramids, and trees of meshes have the same dilations both in the path and in the cycle
Abstract- A set of directed permutation graphs called rotator graphs were proposed as an alternative...
Abstract. The boolean hypercube is a particularly versatile network for parallel computing. It is we...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
AbstractWe prove exact results on dilations in cycles for important parallel computer interconnectio...
We prove several exact results for the dilation of well-known interconnection networks in cycles, na...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
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 present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
[[abstract]]In this paper, we consider two embedding problems in Cartesian product networks: one is ...
[[abstract]]An incomplete hypercube is a generalization of the hypercube in the sense that the numbe...
Abstract—The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube h...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding proble...
Abstract- A set of directed permutation graphs called rotator graphs were proposed as an alternative...
Abstract. The boolean hypercube is a particularly versatile network for parallel computing. It is we...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
AbstractWe prove exact results on dilations in cycles for important parallel computer interconnectio...
We prove several exact results for the dilation of well-known interconnection networks in cycles, na...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
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 present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
[[abstract]]In this paper, we consider two embedding problems in Cartesian product networks: one is ...
[[abstract]]An incomplete hypercube is a generalization of the hypercube in the sense that the numbe...
Abstract—The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube h...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding proble...
Abstract- A set of directed permutation graphs called rotator graphs were proposed as an alternative...
Abstract. The boolean hypercube is a particularly versatile network for parallel computing. It is we...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
DOI
Add to ORKG