Show simple item record

Please use this identifier to cite or link to this item: https://uyr.uy.edu.mm/handle/123456789/576
dc.contributor.authorNang Kham Maing
dc.date.accessioned2018-05-07T08:16:43Z
dc.date.available2018-05-07T08:16:43Z
dc.date.issued2008
dc.identifier.urihttps://uyr.uy.edu.mm/handle/123456789/576
dc.descriptionWe are deeply indebted to Dr. Khin Maung 00, Pro-rector of Lashio University for providing the full facilities and constant encouragement throughout the publication period. We are also extremely grateful to Daw 00 00 Myint, Professor, Head of Mathematics Department, Lashio University for her advise and support of this research work. We profound gratitude also goes to Dr. Yi Myint, Professor, Head of Mathematics Department, West Yangon University and Dr. Nwe Wai Aung, Assistant Lecturer, Mathematics Department, Mandalay University, for their supervising and guideline.en
dc.description.abstractLet 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.en
dc.language.isoenen
dc.publisherUniversities Research Journal (URJ)en
dc.relation.ispartofseries;v0l.1, No.2
dc.subjectDirected networken
dc.subjectShortest pathsen
dc.subjectArc-disjoint Pathen
dc.titleArc-Disjoint Path Pair (APP) Problemen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record