Geodesic
A linear algorithm for the two paths problem on permutation graphs
Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 2, pp. 147-166

Voir la notice de l'article provenant de la source Library of Science

The 'two paths problem' is stated as follows. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two vertex-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂ respectively. In this paper we give a linear (O(|V|+ |E|)) algorithm to solve the above problem on a permutation graph.
Keywords: algorithm, bridge, connectivity, disjoint paths, permutation graph, two paths problem 
@article{DMGT_1995_15_2_a2,
     author = {Gopalakrishnan, C. and Pandu Rangan, C.},
     title = {A linear algorithm for the two paths problem on permutation graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {147--166},
     publisher = {mathdoc},
     volume = {15},
     number = {2},
     year = {1995},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a2/}
}
TY  - JOUR
AU  - Gopalakrishnan, C.
AU  - Pandu Rangan, C.
TI  - A linear algorithm for the two paths problem on permutation graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1995
SP  - 147
EP  - 166
VL  - 15
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a2/
LA  - en
ID  - DMGT_1995_15_2_a2
ER  - 
%0 Journal Article
%A Gopalakrishnan, C.
%A Pandu Rangan, C.
%T A linear algorithm for the two paths problem on permutation graphs
%J Discussiones Mathematicae. Graph Theory
%D 1995
%P 147-166
%V 15
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a2/
%G en
%F DMGT_1995_15_2_a2
Gopalakrishnan, C.; Pandu Rangan, C. A linear algorithm for the two paths problem on permutation graphs. Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 2, pp. 147-166. http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a2/