메뉴 건너뛰기
Information Processing Letters
Volumn 57, Issue 4, 1996, Pages 183-188
Shortest routing in trivalent Cayley graph network
Author keywords

Cayley graph; Diameter; Fixed degree; Interconnection networks; Shortest routing
Indexed keywords

EID: 0037851950     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00004-X     Document Type: Article
Times cited : (12)
References (7)
  • 1
    • 34250833453 scopus 로고
    • A group-theoretic model for symmetric interconnection networks
    • S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38 (1989) 555-566.
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 555-566
    • Akers, S.B.1    Krishnamurthy, B.2
  • 2
    • 0027841693 scopus 로고
    • dBCube: A new class of hierarchical multiprocessor interconnection networks with area efficient layout
    • C. Chen, D.P. Agrawal and J.R. Burke, dBCube: A new class of hierarchical multiprocessor interconnection networks with area efficient layout, IEEE Trans. Parallel Distributed Systems 4 (1993) 1332-1344.
    • (1993) IEEE Trans. Parallel Distributed Systems , vol.4 , pp. 1332-1344
    • Chen, C.1    Agrawal, D.P.2    Burke, J.R.3
  • 3
    • 0020100438 scopus 로고
    • Dense trivalent graphs for processor interconnection
    • W.E. Leland and M.H. Solomon, Dense trivalent graphs for processor interconnection, IEEE Trans. Comput. 31 (1982) 219-222.
    • (1982) IEEE Trans. Comput. , vol.31 , pp. 219-222
    • Leland, W.E.1    Solomon, M.H.2
  • 4
    • 0027259889 scopus 로고
    • Cube connected Möbius ladders: An inherently deadlock free fixed degree network
    • D.J. Pritchard and D.A. Nicole, Cube connected Möbius ladders: An inherently deadlock free fixed degree network, IEEE Trans. Parallel Distributed Systems 4 (1993) 111-117.
    • (1993) IEEE Trans. Parallel Distributed Systems , vol.4 , pp. 111-117
    • Pritchard, D.J.1    Nicole, D.A.2
  • 5
    • 0020178694 scopus 로고
    • A fault tolerant communication architecture for distributed systems
    • D.K. Pradhan and S.M. Reddy, A fault tolerant communication architecture for distributed systems, IEEE Trans. Comput. 31 (1982) 863-870.
    • (1982) IEEE Trans. Comput. , vol.31 , pp. 863-870
    • Pradhan, D.K.1    Reddy, S.M.2
  • 6
    • 34250827211 scopus 로고
    • The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI
    • M.R. Samatham and D.K. Pradhan, The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI, IEEE Trans. Comput. 38 (1989) 567-581.
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 567-581
    • Samatham, M.R.1    Pradhan, D.K.2
  • 7
    • 0029327218 scopus 로고
    • Trivalent Cayley graphs for interconnection networks
    • P. Vadapalli and P.K. Srimani, Trivalent Cayley graphs for interconnection networks, Inform. Process. Lett. 54 (1995) 329-335.
    • (1995) Inform. Process. Lett. , vol.54 , pp. 329-335
    • Vadapalli, P.1    Srimani, P.K.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.