Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
نویسندگان
چکیده
منابع مشابه
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Efficient methods have been developed for constructing m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube so that not only is their total length minimized, but their maximal length is also minimized in the worst case, where m ≤ n. For general case, their maximal length is not greater than the minimum of n + 1 and the ...
متن کاملTwo spanning disjoint paths with required length in generalized hypercubes
This work investigates 2RP-property of a generalized hypercube G. Given any four distinct vertices u, v, x and y in G, let l1 and l2 be two integers such that l1 (l2) is not less than the distance between u and v (x and y), and l1+l2 is equal to the number of vertices in G minus two. Then, there exist two vertex-disjoint paths P1 and P2 such that (1) P1 is a path joining u and v with length of ...
متن کاملAn Optimal Construction of Node-Disjoint Shortest Paths in Hypercubes
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an ndimensional hypercube, provided the existence of such node-disjoint shortest paths which can be verified in O(m...
متن کاملTime Optimal Node-to-Set Disjoint Paths Routing in Hypercubes
Due to their simplicity, hypercubes are a popular topology for the interconnection network of massively parallel systems. One critical issue when dealing with such parallel systems is routing: data transmission is at the center of any operation or computation. Additionally, as the number of processors inside modern supercomputers is huge, and continuously growing, fault tolerance ought to be ad...
متن کاملOn the Existence of Disjoint Spanning Paths in Faulty Hypercubes
Assume that n is a positive integer with n ≥ 4 and F is a subset of the edges of the hypercube Qn with |F | ≤ n−4. Let u, x be two distinct white vertices of Qn and v, y be two distinct black vertices of Qn, where black and white refer to the two parts of the bipartition of Qn. Let l1 and l2 be odd integers, where l1 ≥ dQn−F (u, v), l2 ≥ dQn−F (x,y), and l1 + l2 = 2 n − 2. Moreover, let l3 and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.009