Question: We are given a graph G and four distinct vertices a, b, c, d. We say two paths are disjoint if they do not intersect
We are given a graph G and four distinct vertices a, b, c, d. We say two paths are disjoint if they do not intersect at any vertex. Give an RP algorithm for finding whether there exists a path p1 from a to b and a path p2 from c to d, p1 and p2 disjoint, and |p1| + |p2| < 375, where by |p1| we mean the number of vertices in the path.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
