Name
Title | ||
|---|---|---|
Analysis of Interconnection Networks Based on Cayley Graphs of Strong Generating Sets |
Abstract | ||
|---|---|---|
This paper describes a class of interconnection networks based on Cayley graph of (S_n, Omega_CT)> where S_n is the symmetric group of degree n and order n! and Omega_CT is the generator set consisting of all the n (n -1)/2 transpositions, called the complete transposition graph (CTG). A complete enumeration of a set of node disjoint paths for CTG is given which in turn implies that CTG has maximum fault-tolerance. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/ICPP.1994.60 | ICPP (1) |
Keywords | Field | DocType |
cayley graphs,routing algorithm,strong generating sets.,complete transposition graph,complete enumeration,order n,symmetric group,cayley graph,interconnection networks,interconnection network,strong generating sets,degree n,maximum fault-tolerance,node disjoint path,networks,fault tolerance,parallel processing,network routing,sorting,fault tolerant,routing,tin,hypercubes,computer science | Disjoint sets,Symmetric group,Computer science,Enumeration,Cayley graph,Parallel computing,Sorting,Omega,Interconnection,Hypercube,Distributed computing | Conference |
Volume | ISSN | ISBN |
1 | 0190-3918 | 0-8493-2493-9 |
Citations | PageRank | References |
1 | 0.40 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jen-Peng Huang | 1 | 57 | 6.45 |
| S. Lakshmivarahan | 2 | 412 | 66.03 |
| Dhall | 3 | 271 | 80.48 |