Antoine Bossard, Keiichi Kaneko. Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. J. Inf. Sci. Eng., 30(4):1087-1093, 2014. [doi]
@article{BossardK14-1,
title = {Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes},
author = {Antoine Bossard and Keiichi Kaneko},
year = {2014},
url = {http://www.iis.sinica.edu.tw/page/jise/2014/201407_09.html},
researchr = {https://researchr.org/publication/BossardK14-1},
cites = {0},
citedby = {0},
journal = {J. Inf. Sci. Eng.},
volume = {30},
number = {4},
pages = {1087-1093},
}