A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Ding-Ming Kwai, Behrooz Parhami. A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes. In 1997 International Conference on Parallel Processing (ICPP 97), August 11-15, 1997, Bloomington, IL, USA, Proceedings. pages 92-95, IEEE Computer Society, 1997. [doi]

This author has not been identified. Look up 'Ding-Ming Kwai' in GoogleThis author has not been identified. Look up 'Behrooz Parhami' in Google

runs on WebDSL