2024-10-11T18:56:27Z
https://meral.edu.mm/oai
oai:meral.edu.mm:recid/2149
2021-12-13T04:09:09Z
1582963390870:1582967739683
user-uy
Arc-Disjoint Path Pair (APP) Problem
Nang Kham Maing
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.
2008
http://hdl.handle.net/20.500.12678/0000002149
https://meral.edu.mm/records/2149