论文信息 - The complexity of finding two disjoint paths with min-max objective function - 字舞流文

The complexity of finding two disjoint paths with min-max objective function

Chung-Lun Li | S. Thomas McCormick | David Simchi-Levi | S. T. McCormick | Chung-lun Li | D. Simchi-Levi | Chung-Lun Li | S. McCormick | Thomas S. McCormick | David Simich-Levi

[1] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[2] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.

[3] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[4] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[5] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[6] Chung-lun Li,et al. Complexity and worst-case analysis of some network and routing problems , 1990 .

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

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.

[10] Frank Harary,et al. Graph Theory , 2016 .