论文信息 - A New Linear Algorithm for the Two Path Problem on Chordal Graphs

A New Linear Algorithm for the Two Path Problem on Chordal Graphs

Let G= (V,E) be a finite undirected graph with four distinguished vertices s, t, u, v. The two path problem (TPP) is to determine whether there exist two vertex disjoint paths connecting s with t and u with v and to find such paths if they exist.

[1] Yehoshua Perl,et al. Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph , 1978, JACM.

[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[3] M. Golumbic. CHAPTER 3 – Perfect Graphs , 1980 .

[4] Tatsuo Ohtsuki,et al. The two disjoint path problem and wire routing design , 1980, Graph Theory and Algorithms.

[5] Yossi Shiloach,et al. A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.