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

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.