Name
Abstract | ||
|---|---|---|
Recently, Draper initiated the study of interconnection networks based on Cayley graphs of semidirect products of two cyclic groups called supertoroids. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. The Borel graphs introduced by Arden and Tang are a family of Cayley graphs based on a special class of matrix groups. In this paper, we describe a deterministic, distributed routing scheme for supertoroids. While we do not have a proof of correctness of our scheme, experimental evidence leads to a natural conjecture that our scheme is a shortest path routing algorithm. By proving the similarities among supertoroids, Borel graphs, and metacyclic graphs, this routing scheme is then extended to Borel graphs. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1006/jpdc.2000.1624 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
semidirect product,cayley graph,finite group,cyclic group | Discrete mathematics,Indifference graph,Combinatorics,Cyclic group,Chordal graph,Cayley graph,Finite group,Longest path problem,Mathematics,Matrix group,Maximal independent set | Journal |
Volume | Issue | ISSN |
60 | 5 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
3 | 0.51 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fen Lin Wu | 1 | 3 | 0.51 |
| S. Lakshmivarahan | 2 | 412 | 66.03 |
| Dhall | 3 | 271 | 80.48 |