Node-Disjoint Paths
On Approximating Node-Disjoint Paths in Grids
... the Node-Disjoint Paths (NDP) problem, the input is an undirected n-vertex graph G, and a collection {(s 1 , t 1 ), ...resulting paths are ...
25
CiteSeerX — Maximum-Bandwidth Node-Disjoint Paths
... King Saud University Riyadh, Saudi Arabia Abstract—This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an ...
9
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
... Fourth, paths common between the two constructed disjoint paths and the cycles that do not contain both the endpoints are removed prior to constructing the two disjoint ...link paths ...
14
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
... the disjoint paths problem with the same time complexity as ...The node disjoint paths algorithms based on Maximum-Flow computation such as Ford-Fulkerson and Suur- balle-Tarjan [19], ...
14
CiteSeerX — A Hybrid Protocol for Identification of a Maximal Set of Node Disjoint Paths in
... of node-disjoint paths between a given source and a destination is a challenging task in mobile ad hoc ...of node-disjoint paths in a single sequence of request-reply ...of ...
22
Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability
... Digital Research Center of SFAX (CRNS), University of Sfax, Tunisia † University of Rennes 1, IRISA, France Abstract—Carrier grade networks are in general over- dimensioned in order to protect against network resource ...
8
CiteSeerX — Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth
... root node i iff (β i , Λ i ) is a partial solution with β i (v) = k for v ∈ {s, t} ∩ X i and β i (v) ∈ {o, ∞} for all v ∈ X i \ {s, ...k node- disjoint paths between s and ...
12
CiteSeerX — One-to-many node-disjoint paths in (n, k)-star graphs
... c node-disjoint paths from s to t 1 , t 2 , ...decomposability, node-symmetry, and degree regularity, the situation is much more acceptable (see, for example, [1, 2, 5, 8, 9, 10, 11, 14, 15, ...
21
Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks
... multiple paths for the ...shortest node-disjoint paths in existing networks are well studied in the ...short node-disjoint paths in polynomial ...shortest ...
7
One-to-many node-disjoint paths of hyper-star networks
... Next, we choose the first edge on each of the paths. Clearly, each of these edges must be an i-edge for some i > n, because u = 0 n 1 n . First, select as many 1s from M 2 as possible with the restriction that we ...
9
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
... As shown above, two trivial worst cases are excluded in computing the probability. In fact, there exist other worst cases in which the maximal length of any n disjoint paths from s to d 1 , d 2 , . . . , d ...
10
Optimal Link-Disjoint Node-“Somewhat Disjoint” Paths
... or node disjoint paths with a minimum sum of link ...optimal node-disjoint and link- disjoint ...link-disjoint paths while restricting the number of its common ...
10
Minimum-Weight Link-Disjoint Node-“Somewhat Disjoint” Paths
... or node disjoint paths with a minimum sum of link ...optimal node-disjoint and link- disjoint ...link-disjoint paths while restricting the number of its common ...
14
Constraint-based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks
... Abstract. Mass deployment of fibre access networks is without doubt one of the goals of many network operators around the globe. The Pas- sive Optical Network has been proposed as a solution to help deliver mass ...
9
A QoS based Analysis of Disjoint Node Multipath Routing for MANET
... on Node-Disjoint Multipath Routing Protocol (NDMR) in mobile ad hoc ...multiple node-disjoint paths gives the opportunity for allocating packets to paths in an optimum way to ...
6
End-to-End Key Exchange through Disjoint Paths in P2P Networks
... k Disjoint Paths. In our context, the disjoint paths term means vertex/node-disjoint ...Two paths are vertex-disjoint if they have no vertex in common except for ...
15
Performance Betterments of Disjoint Paths in Designing an Efficient Multipath Routing in MANETs
... new paths. Node-disjoint paths have many applications in multipath ...find node-disjoint ...possible paths. Every node also maintains a route request table which ...
7
If a link-disjoint (node-disjoint, respectively) active-backup path pair can be found at the time of the request, the paths are established
... Informally, it can be stated as follows: Given a set Λe ⊆ Λ of wavelengths available on each link e, is it possible to establish an active and a backup path between a specified source-de[r] ...
11
Planar Disjoint-Paths Completion
... We note that the proof of our combinatorial theorem could be of independent interest. In fact, it is one of the ingredients of the proof of the main result of [1]. The algorithm for PDPC. As the number of patches is ...
31
Disjoint paths in sparse graphs
... short paths in P N , and, on the other hand, MST-GVY can in fact be iterated several times, the following heuristic, parameterized by a small integer λ ≥ 0, would probably be better than MST-GVY ...
11