Qian-Ping Gu, Shietung Peng. An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. In 1996 International Conference on Parallel and Distributed Systems (ICPADS 96), June 3-6, 1996, Tokyo, Japan, Proceedings. pages 98-105, IEEE Computer Society, 1996. [doi]
@inproceedings{GuP96,
title = {An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes},
author = {Qian-Ping Gu and Shietung Peng},
year = {1996},
url = {http://computer.org/proceedings/icpads/7267/72670098abs.htm},
researchr = {https://researchr.org/publication/GuP96},
cites = {0},
citedby = {0},
pages = {98-105},
booktitle = {1996 International Conference on Parallel and Distributed Systems (ICPADS 96), June 3-6, 1996, Tokyo, Japan, Proceedings},
publisher = {IEEE Computer Society},
}