Name
Abstract | ||
|---|---|---|
The authors present an analysis of a new class of interconnection scheme based on the Cayley graph of the alternating group. The definition and an analysis of the symmetry of this class of graphs are presented, and a shortest-path routing algorithm is given. An algorithm for embedding of the Hamiltonian cycle is presented, and an algorithm for embedding grids is given. A greedy spanning tree algorithm for one source broadcasting and an analysis of the contention problem are also given. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/SPDP.1992.242706 | Arlington, TX |
Keywords | Field | DocType |
embedding grid,contention problem,cayley graph,shortest-path routing algorithm,interconnection network,new class,tree algorithm,source broadcasting,hamiltonian cycle,interconnection scheme,tree graphs,routing,computer networks,alternating group,information science,embedding,information analysis,algorithm design and analysis,tree data structures,broadcasting,spanning tree,concurrent computing,hypercubes | Embedding,Computer science,Hamiltonian path,Cayley graph,Tree (data structure),Interconnection,Reverse-delete algorithm,Distributed computing,Spanning Tree Protocol,Alternating group | Conference |
Volume | Issue | ISSN |
23 | 4 | 0028-3045 |
ISBN | Citations | PageRank |
0-8186-3200-3 | 80 | 4.39 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jung-Sing Jwo | 1 | 357 | 34.18 |
| S. Lakshmivarahan | 2 | 412 | 66.03 |
| Sudarshan K. Dhall | 3 | 522 | 60.65 |