Add to ORKG[[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
AbstractAn embedding of Kn into a hypercube is a mapping, gf, of the n vertices of Kn to distinct ve...
AbstractIn this paper, we suggest an algorithm paradigm for incomplete hypercubes. Using this paradi...
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...
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a n...
The hypercube is emerging as one of the most effective and popular network architectures for large s...
[[abstract]]It has been proved that an incomplete binary tree cannot be embedded into an incomplete ...
AbstractIn this paper, we show that any incomplete hypercube with, at most, 2n+2n−1+2n−2 vertices ca...
Many parallel algorithms use hypercubes as the communication topology among processes, which make th...
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...
AbstractA lot of research has been devoted to finding efficient embedding of trees into hypercubes. ...
AbstractAn embedding of Kn into a hypercube is a mapping, gf, of the n vertices of Kn to distinct ve...
AbstractIn this paper, we suggest an algorithm paradigm for incomplete hypercubes. Using this paradi...
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...
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a n...
The hypercube is emerging as one of the most effective and popular network architectures for large s...
[[abstract]]It has been proved that an incomplete binary tree cannot be embedded into an incomplete ...
AbstractIn this paper, we show that any incomplete hypercube with, at most, 2n+2n−1+2n−2 vertices ca...
Many parallel algorithms use hypercubes as the communication topology among processes, which make th...
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...
AbstractA lot of research has been devoted to finding efficient embedding of trees into hypercubes. ...
AbstractAn embedding of Kn into a hypercube is a mapping, gf, of the n vertices of Kn to distinct ve...
AbstractIn this paper, we suggest an algorithm paradigm for incomplete hypercubes. Using this paradi...
Graphs and AlgorithmsIn this paper, we study long cycles in induced subgraphs of hypercubes obtained...