On the embedding of cycles in pancake graphs /
Abstract: "In 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 symm...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1993]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
93-033. |
| Subjects: |
| Summary: | Abstract: "In 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 have been solved recently." |
|---|---|
| Item Description: | Cover title. |
| Physical Description: | ii, 14 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |