Name
Abstract | ||
|---|---|---|
The use of star graphs as a viable interconnection scheme for parallel computers has been examined by a number of authors. An attractive feature of this class of graphs is that it has sublogarithmic diameter and has a great deal of symmetry akin to the binary hypercube. The authors describe a new class of algorithms for embedding Hamiltonian cycle, the set of all even cycles and a variety of two and multi-dimensional grids in a star graph. They derive an algorithm for the ranking and the unranking problem with respect to the Hamiltonian cycle. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/SPDP.1990.143600 | Journal of Circuits, Systems and Computers |
Keywords | DocType | Volume |
new class,star graph,attractive feature,multi-dimensional grid,binary hypercube,great deal,embedding hamiltonian cycle,parallel computer,hamiltonian cycle,sublogarithmic diameter,concurrent computing,tree graphs,embedded computing,hypercubes,graphs,embedding,graph theory,parallel processing,data structures,ranking,computer science | Conference | 1 |
Issue | ISBN | Citations |
1 | 0-8186-2087-0 | 72 |
PageRank | References | Authors |
7.12 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jung-Sing Jwo | 1 | 357 | 34.18 |
| Lakshmivarahan | 2 | 76 | 7.65 |
| Sudarshan K. Dhall | 3 | 522 | 60.65 |