Shortest routing in trivalent Cayley graph network
From MaRDI portal
Publication:672093
DOI10.1016/0020-0190(96)00004-XzbMath0900.68330MaRDI QIDQ672093
Premkumar Vadapalli, Pradip K. Srimani
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00004-x
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS, A new 3D representation of trivalent Cayley networks, The correct diameter of trivalent Cayley graphs., On the pagenumber of trivalent Cayley graphs
Cites Work
- Trivalent Cayley graphs for interconnection networks
- The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
- A group-theoretic model for symmetric interconnection networks
- Dense Trivalent Graphs for Processor Interconnection
- A Fault-Tolerant Communication Architecture for Distributed Systems