Perl, Y.; Shiloach, Y. Finding two disjoint paths between two pairs of vertices in a graph. (English) Zbl 0365.68026 J. Assoc. Comput. Mach. 25, 1-9 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 46 Documents MSC: 68W99 Algorithms in computer science 05C20 Directed graphs (digraphs), tournaments 68Q25 Analysis of algorithms and problem complexity 05C35 Extremal problems in graph theory PDFBibTeX XMLCite \textit{Y. Perl} and \textit{Y. Shiloach}, J. Assoc. Comput. Mach. 25, 1--9 (1978; Zbl 0365.68026) Full Text: DOI