Abstract
In this paper we consider the following problem. Given an undirected graph G=(V, E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge-disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2 respectively. We give a linear (O(¦ V ¦ + ¦ E ¦)) algorithm to solve this problem on a permutation graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
