An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Qian-Ping Gu' in GoogleThis author has not been identified. Look up 'Shietung Peng' in Google

runs on WebDSL