National Taiwan University Dept Chem EngnLai, Cheng-NanCheng-NanLaiChen, Gen HueyGen HueyChen2006-11-142018-06-282006-11-142018-06-282005https://www.scopus.com/inward/record.uri?eid=2-s2.0-23844513092&doi=10.1016%2fj.tcs.2005.02.010&partnerID=40&md5=7d1e45e43af43f91c203b2d0e6cf4e1cThe strong Rabin number of a network W of connectivity k is the minimum l so that for any k +1 nodes s, d1, d2, . . . , dk of W, there exist k node-disjoint paths from s to d1, d2, . . . , dk, respectively, whose maximal length is not greater than l, where s /â {d1, d2, . . . , dk} and d1, d2, . . . , dk are not necessarily distinct. In this paper, we show that the strong Rabin number of a k-dimensional folded hypercube is k/2 + 1, where k/2 is the diameter of the k-dimensional folded hypercube. Each node-disjoint path we obtain has length not greater than the distance between the two end nodes plus two. This paper solves an open problem raised by Liaw and Chang.application/pdf542082 bytesapplication/pdfen-USFolded hypercubeHypercubeNode-disjoint pathsOptimization problemStrong Rabin numberjournal article10.1016/j.tcs.2005.02.0102-s2.0-23844513092http://ntur.lib.ntu.edu.tw/bitstream/246246/2006111501244229/1/2635.pdf