{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T12:12:19Z","timestamp":1704283939606},"reference-count":0,"publisher":"Faculty of Electrical Engineering and Computing, Univ. of Zagreb","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CIT. J. comput. inf. technol"],"abstract":"<jats:p>Given two distinct vertices (nodes) source s and target t of a graph G = (V, E), the two node-disjoint paths problem is to identify two node-disjoint paths between s \u2208 V and t \u2208 V. Two paths are node-disjoint if they have no common intermediate vertices. In this paper, we present an algorithm with O(m)-time complexity for finding two node-disjoint paths between s and t in arbitrary graphs where m is the number of edges. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.<\/jats:p>","DOI":"10.20532\/cit.2019.1004754","type":"journal-article","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T13:59:46Z","timestamp":1588859986000},"page":"1-14","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs"],"prefix":"10.20532","volume":"27","author":[{"given":"Mehmet","family":"Karaata","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Kuwait University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"8460","published-online":{"date-parts":[[2020,5,7]]},"container-title":["Journal of Computing and Information Technology"],"original-title":[],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T13:59:47Z","timestamp":1588859987000},"score":1,"resource":{"primary":{"URL":"http:\/\/cit.fer.hr\/index.php\/CIT\/article\/view\/4754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,7]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,5,7]]}},"URL":"https:\/\/doi.org\/10.20532\/cit.2019.1004754","relation":{},"ISSN":["1330-1136","1846-3908"],"issn-type":[{"value":"1330-1136","type":"print"},{"value":"1846-3908","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,7]]}}}