Set-to-set disjoint-path routing in perfect hierarchical hypercubes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Antoine Bossard, Keiichi Kaneko. Set-to-set disjoint-path routing in perfect hierarchical hypercubes. In Bipin C. Desai, Alain Abran, Sudhir P. Mudur, editors, Fourth International C* Conference on Computer Science & Software Engineering, C3S2E 2011, Montreal, Quebec, Canada, May 16-18, 2011, Proceedings. pages 51-57, ACM, 2011. [doi]

This author has not been identified. Look up 'Antoine Bossard' in GoogleThis author has not been identified. Look up 'Keiichi Kaneko' in Google

runs on WebDSL