IEEE - Institute of Electrical and Electronics Engineers, Inc. - An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes

Proceedings of 1996 International Conference on Parallel and Distributed Systems

Author(s): Qian-Ping Gu ; Shietung Peng
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1996
Conference Location: Tokyo, Japan, Japan
Conference Date: 3 June 1996
Page(s): 98 - 105
ISBN (Paper): 0-8186-7267-6
DOI: 10.1109/ICPADS.1996.517550
Regular:

Set-to-set node-disjoint paths problem is that given two sets S={s/sub 1/,...,s/sub k/} and T={t/sub 1/,...,t/sub k/} of nodes in a graph, find k node disjoint paths s/sub i//spl rarr/t/sub ji/,... View More

Advertisement