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]
@inproceedings{BossardK11,
title = {Set-to-set disjoint-path routing in perfect hierarchical hypercubes},
author = {Antoine Bossard and Keiichi Kaneko},
year = {2011},
doi = {10.1145/1992896.1992903},
url = {http://doi.acm.org/10.1145/1992896.1992903},
tags = {routing},
researchr = {https://researchr.org/publication/BossardK11},
cites = {0},
citedby = {0},
pages = {51-57},
booktitle = {Fourth International C* Conference on Computer Science & Software Engineering, C3S2E 2011, Montreal, Quebec, Canada, May 16-18, 2011, Proceedings},
editor = {Bipin C. Desai and Alain Abran and Sudhir P. Mudur},
publisher = {ACM},
isbn = {978-1-4503-0626-3},
}