hrcak mascot   Srce   HID

Original scientific paper
https://doi.org/10.20532/cit.2019.1004754

An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs

Mehmet Hakan Karaata ; Department of Computer Engineering, Kuwait University

Fulltext: english, pdf (483 KB) pages 1-14 downloads: 124* cite
APA 6th Edition
Karaata, M.H. (2019). An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs. Journal of computing and information technology, 27 (3), 1-14. https://doi.org/10.20532/cit.2019.1004754
MLA 8th Edition
Karaata, Mehmet Hakan. "An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs." Journal of computing and information technology, vol. 27, no. 3, 2019, pp. 1-14. https://doi.org/10.20532/cit.2019.1004754. Accessed 15 May 2021.
Chicago 17th Edition
Karaata, Mehmet Hakan. "An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs." Journal of computing and information technology 27, no. 3 (2019): 1-14. https://doi.org/10.20532/cit.2019.1004754
Harvard
Karaata, M.H. (2019). 'An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs', Journal of computing and information technology, 27(3), pp. 1-14. https://doi.org/10.20532/cit.2019.1004754
Vancouver
Karaata MH. An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs. Journal of computing and information technology [Internet]. 2019 [cited 2021 May 15];27(3):1-14. https://doi.org/10.20532/cit.2019.1004754
IEEE
M.H. Karaata, "An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs", Journal of computing and information technology, vol.27, no. 3, pp. 1-14, 2019. [Online]. https://doi.org/10.20532/cit.2019.1004754

Abstracts
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 ∈ V and t ∈ 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.

Keywords
disjoint paths, distributed systems, fault tolerance, network routing, security

Hrčak ID: 237989

URI
https://hrcak.srce.hr/237989

Visits: 223 *