MATHEMATICAL ENGINEERING TECHNICAL REPORTS On Shortest Disjoint Paths in Planar Graphs

[1]  Si-Qing Zheng,et al.  Finding Two Disjoint Paths in a Network with Normalized alpha+-MIN-SUM Objective Function , 2005, ISAAC.

[2]  Eytan Modiano,et al.  Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks , 2005, Wirel. Networks.

[3]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[4]  R. Halin.  S-functions for graphs , 1976 .

[5]  Si-Qing Zheng,et al.  Finding Two Disjoint Paths in a Network with Min-Min Objective Function , 2003 .

[6]  James F. Lynch,et al.  The equivalence of theorem proving and the interconnection problem , 1975, SIGD.

[7]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[8]  Paul D. Seymour.  Disjoint paths in graphs , 2006, Discret. Math..

[9]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

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

[11]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[12]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

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

[14]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

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

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  Nachum Shacham,et al.  Distributed algorithms for computing shortest pairs of disjoint paths , 1993, IEEE Trans. Inf. Theory.

[18]  Carsten Thomassen,et al.  2-Linked Graphs , 1980, Eur. J. Comb..

[19]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[20]  Alexander Schrijver,et al.  Finding k Disjoint Paths in a Directed Planar Graph , 1994, SIAM J. Comput..

[21]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..