{"created":"2020-03-08T23:27:32.864948+00:00","id":2149,"links":{},"metadata":{"_buckets":{"deposit":"5990700f-f808-42b2-a0ab-900a4b527d3e"},"_deposit":{"id":"2149","owners":[],"pid":{"revision_id":0,"type":"recid","value":"2149"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/2149","sets":["1582963390870:1582967739683"]},"communities":["ccm","ccp","kyauksetu","ltc","maas","miit","mlmu","mmu","mtlu","mtu","mub","mude","mufl","pathein","scu","suoe","tcu","tgu","tuh","tum","ucsm","ucsmtla","ucsmub","ucspathein","ucstaungoo","ucsy","udmm","udmy","uit","um","um1","um2","umkn","umm","uphy","urj","uvs","uy","yau","ydbu","ytu","yude","yueco","yufl","yuoe"],"control_number":"2149","item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Arc-Disjoint Path Pair (APP) Problem","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"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."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value_mlt":[{"interim":"Directed network"}]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2020-05-05"}],"displaytype":"preview","filename":"Arc-Disjoint Path Pair (APP) Problem.pdf","filesize":[{"value":"3832 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/2149/files/Arc-Disjoint Path Pair (APP) Problem.pdf"},"version_id":"e00809a0-b373-4b61-950c-44c2efde3db4"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"2","subitem_journal_title":"Universities Research Journal (URJ)"}]},"item_1583103147082":{"attribute_name":"Conference papaers","attribute_value_mlt":[{}]},"item_1583103211336":{"attribute_name":"Books/reports/chapters","attribute_value_mlt":[{}]},"item_1583103233624":{"attribute_name":"Thesis/dissertations","attribute_value_mlt":[{"subitem_supervisor(s)":[]}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Nang Kham Maing"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Journal article"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2008"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"https://uyr.uy.edu.mm/handle/123456789/576"},"item_title":"Arc-Disjoint Path Pair (APP) Problem","item_type_id":"21","owner":"1","path":["1582967739683"],"publish_date":"2020-03-05","publish_status":"0","recid":"2149","relation_version_is_last":true,"title":["Arc-Disjoint Path Pair (APP) Problem"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2021-12-13T04:09:09.908151+00:00"}