Open AccessA linear algorithms for the two paths problem on permutation graphs
Author(s) -
C.P. Gopalakrishnan,
Chitra 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.1013
Subject(s) - mathematics , combinatorics , permutation (music) , permutation graph , algorithm , discrete mathematics , graph , physics , acoustics
The ‘two paths problem’ is stated as follows. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two vertex-disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2 respectively. In this paper we give a linear (O(| V | + | E |)) algorithm to solve the above 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