Ke Qiu. An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube. In 14th International Conference on Parallel and Distributed Systems (ICPADS 2008), December 8-10, 2008, Melbourne, Victoria, Australia. pages 43-47, IEEE, 2008. [doi]
@inproceedings{Qiu08:0, title = {An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube}, author = {Ke Qiu}, year = {2008}, doi = {10.1109/ICPADS.2008.119}, url = {http://dx.doi.org/10.1109/ICPADS.2008.119}, tags = {routing}, researchr = {https://researchr.org/publication/Qiu08%3A0}, cites = {0}, citedby = {0}, pages = {43-47}, booktitle = {14th International Conference on Parallel and Distributed Systems (ICPADS 2008), December 8-10, 2008, Melbourne, Victoria, Australia}, publisher = {IEEE}, }