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: | Mehmet Hakan Karaata |
---|---|
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 |
Similar Items
-
Many-to-Many Disjoint Paths in Augmented Cubes With Exponential Fault Edges
by: Mingzu Zhang, et al.
Published: (2021-01-01) -
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability
by: Yuri Pirola, et al.
Published: (2012-12-01) -
The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability
by: Diego Lopez-Pajares, et al.
Published: (2021-01-01) -
Disjoint Secure Domination in the Join of Graphs
by: Jonecis Dayap, et al.
Published: (2016-12-01) -
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs
by: Yanling Wang, et al.
Published: (2021-09-01)