Node-Disjoint Shortest and Next-to-Shortest Paths in N-Dimensional Hypercube
نویسندگان
چکیده
منابع مشابه
Shortest node-disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کامل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...
متن کاملPairwise edge disjoint shortest paths in the n-cube
Complexity issues intrinsic to certain fundamental data dissemination problems in high-performance network topologies are discussed. In particular, we study the p-pairwise edge disjoint shortest paths problem.An efficient algorithm for the case when every source point is at a distance at most two from its target is presented and for pairs at a distance at most three we show that the problem is ...
متن کاملOn Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path from si to ti for each i = 1, . . . , k. In the corresponding optimization problem, the shortest disjoint paths problem, the vertex-disjoint paths Pi have to be chosen such that a given objective function is minimized. We...
متن کاملShortest Two Disjoint Paths in Polynomial Time
Given an undirected graph and two pairs of vertices (si, ti) for i ∈ {1, 2} we show that there is a polynomial time Monte Carlo algorithm that finds disjoint paths of smallest total length joining si and ti for i ∈ {1, 2} respectively, or concludes that there most likely are no such paths at all. Our algorithm applies to both the vertexand edge-disjoint versions of the problem. Our algorithm is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pure Mathematics
سال: 2017
ISSN: 2160-7583,2160-7605
DOI: 10.12677/pm.2017.74029