Open AccessEdge-disjoint paths in permutation graphs
Author(s) -
C.P. Gopalakrishnan,
C. Pandu Rangan
Publication year - 1995
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1007
Subject(s) - mathematics , combinatorics , disjoint sets , permutation graph , enhanced data rates for gsm evolution , permutation (music) , discrete mathematics , graph , computer science , artificial intelligence , physics , acoustics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom