A new 3D representation of trivalent Cayley networks

Information Processing Letters

Volumn 61, Issue 5, 1997, Pages 247-252

  Calamoneri, Tiziana ^a   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Cayley graph; Interconnection network; Optimal routing

Indexed keywords

EID: 30244505200     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00027-6     Document Type: Article

References (6)

1. F.T. Leighton, Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks (MIT Press, Cambridge, MA, 1983).
2. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufmann, Los Altos, CA, 1992).
3. D.K. Pradhan and S.M. Reddy, A fault tolerant communication architecture for distributed systems, IEEE Trans. Comput. 31 (1982) 863-870.
4. F.P. Preparata and J. Vuillemin, The cube-connected cycles: a versatile network for parallel computation, Comm. ACM 24 (1981) 300-309.
5. P. Vadapalli and P.K. Srimani, Trivalent Cayley graphs for interconnection networks, Inform. Process. Lett. 54 (1995) 329-335.
6. P. Vadapalli and P.K. Srimani, Shortest routing in trivalent Cayley graphs, Inform. Process. Lett. 57 (1996) 183-188.