Skip to main content
Conference Proceedings

Edge-disjoint paths in permutation graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 834 LNCS 208-216
DOI: 10.1007/3-540-58325-4_183
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 P1 connecting s1 with t1 and s2 with t1 respectively. We give a linear (O(| V | + | E |)) algorithm to solve this problem on a permutation graph.

Cite

CITATION STYLE

APA

Gopalakrishnan, C. P., & Rangan, C. P. (1994). Edge-disjoint paths in permutation graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 208–216). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_183

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free