Please use this identifier to cite or link to this item:
Arc-Disjoint Path Pair (APP) Problem
- Let G (V, A) be a directed network containing n nodes vЄ V and m arcs (i, j) Є A, each with a non-negative length. In this paper arc-disjoint path pair problem is considered, which is to find a pair of arc-disjoint paths from a source to a destination in a directed network. We described Bhandari's algorithm to solve arc-disjoint path pair problem and also proved the correctness of algorithm.
Nang Kham Maing
- Universities Research Journal (URJ)