Add to ORKGIn recent times the use of star and pancake networks as a viable interconnection scheme for parallel computers has been examined by a number of researchers. An attractive feature of these two classes of graphs is that they have sublogarithmic diameter and have a great deal of symmetry akin to the binary hypercube. In this paper we describe new algorithms for embedding: (a) Hamiltonian cycles along with ranking and unranking algorithms with respect to them, and (b) The set of cycles. The analogous problems for star graphs has been solved recently [5]
The search for edge-disjoint Hamilton cycles in star graphs is important for the design of interconn...
The star-connected cycles (SCC) graph was recently proposed as an alternative to the cube-connected ...
Let G and H be two simple undirected graphs. An embedding of the graph G into the graph H is an inje...
International audienceOwing to its nice properties, the pancake is one of the Cayley graphs that wer...
Among Cayley graphs on the symmetric group, the pancake graph is one as a viable interconnection sch...
The star and pancake graphs are useful interconnection networks for connecting processors in a paral...
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding proble...
It is shown that, in the star graph, it is always possible to form a Hamiltonian path between two no...
Abstract- A set of directed permutation graphs called rotator graphs were proposed as an alternative...
[[abstract]]In this paper, we consider two embedding problems in Cartesian product networks: one is ...
[[abstract]]The (n, k)-star graph (S-n,S-k for short) is an attractive alternative to the hypercube ...
[[abstract]]A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distin...
Methods are presented to embed Hamiltonian paths (H-paths) and Hamiltonian cycles (H-cycles) in a st...
The paper describes a new interconnection network for massively parallel systems, referred to as sta...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
The search for edge-disjoint Hamilton cycles in star graphs is important for the design of interconn...
The star-connected cycles (SCC) graph was recently proposed as an alternative to the cube-connected ...
Let G and H be two simple undirected graphs. An embedding of the graph G into the graph H is an inje...
International audienceOwing to its nice properties, the pancake is one of the Cayley graphs that wer...
Among Cayley graphs on the symmetric group, the pancake graph is one as a viable interconnection sch...
The star and pancake graphs are useful interconnection networks for connecting processors in a paral...
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding proble...
It is shown that, in the star graph, it is always possible to form a Hamiltonian path between two no...
Abstract- A set of directed permutation graphs called rotator graphs were proposed as an alternative...
[[abstract]]In this paper, we consider two embedding problems in Cartesian product networks: one is ...
[[abstract]]The (n, k)-star graph (S-n,S-k for short) is an attractive alternative to the hypercube ...
[[abstract]]A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distin...
Methods are presented to embed Hamiltonian paths (H-paths) and Hamiltonian cycles (H-cycles) in a st...
The paper describes a new interconnection network for massively parallel systems, referred to as sta...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
The search for edge-disjoint Hamilton cycles in star graphs is important for the design of interconn...
The star-connected cycles (SCC) graph was recently proposed as an alternative to the cube-connected ...
Let G and H be two simple undirected graphs. An embedding of the graph G into the graph H is an inje...