An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zagreb Faculty of Electrical Engineering and Computing
2019-01-01
|
| Series: | Journal of Computing and Information Technology |
| Subjects: | |
| Online Access: | https://hrcak.srce.hr/file/345601 |