[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, the embedding of cycles has been an important issue. In this paper, we propose an optimal algorithm to embed cycles of arbitrary length into incomplete hypercubes.[[fileno]]2030256010076[[department]]資訊工程學
We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (with...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
Graphs and AlgorithmsIn this paper, we study long cycles in induced subgraphs of hypercubes obtained...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
[[abstract]]An incomplete hypercube is a generalization of the hypercube in the sense that the numbe...
[[abstract]]It is well known that the general problem of finding a Hamilton cycle (ring) in an arbit...
AbstractIn this paper, we show that any incomplete hypercube with, at most, 2n+2n−1+2n−2 vertices ca...
The hypercube is emerging as one of the most effective and popular network architectures for large s...
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a n...
[[abstract]]It has been proved that an incomplete binary tree cannot be embedded into an incomplete ...
Many parallel algorithms use hypercubes as the communication topology among processes, which make th...
AbstractThis work investigates important properties related to cycles of embedding into the folded h...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
AbstractThe problem of existence of an optimal-length (long) fault-free cycle in the n-dimensional h...
We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (with...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
Graphs and AlgorithmsIn this paper, we study long cycles in induced subgraphs of hypercubes obtained...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
[[abstract]]An incomplete hypercube is a generalization of the hypercube in the sense that the numbe...
[[abstract]]It is well known that the general problem of finding a Hamilton cycle (ring) in an arbit...
AbstractIn this paper, we show that any incomplete hypercube with, at most, 2n+2n−1+2n−2 vertices ca...
The hypercube is emerging as one of the most effective and popular network architectures for large s...
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a n...
[[abstract]]It has been proved that an incomplete binary tree cannot be embedded into an incomplete ...
Many parallel algorithms use hypercubes as the communication topology among processes, which make th...
AbstractThis work investigates important properties related to cycles of embedding into the folded h...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
AbstractThe problem of existence of an optimal-length (long) fault-free cycle in the n-dimensional h...
We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (with...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
Graphs and AlgorithmsIn this paper, we study long cycles in induced subgraphs of hypercubes obtained...
DOI
Add to ORKG