A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs
暂无分享,去创建一个
[1] Haruko Okamura,et al. Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.
[2] Takao Nishizeki,et al. Finding Steiner forests in planar graphs , 1990, SODA '90.
[3] Karsten Weihe. Multicommodity Flows in Even, Planar Networks , 1993, ISAAC.
[4] Refael Hassin,et al. Maximum Flow in (s, t) Planar Networks , 1981, Inf. Process. Lett..
[5] Michael Kaufmann. A linear-time algorithm for routing in a convex grid , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Michael Kaufmann,et al. A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs , 1991, ISA.
[7] Alon Itai,et al. Maximum Flow in Planar Networks , 1979, SIAM J. Comput..
[8] Robert E. Tarjan,et al. A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..
[9] Nobuji Saito,et al. An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks , 1985, SIAM J. Comput..
[10] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[11] Nobuji Saito,et al. Multicommodity flows in planar undirected graphs and shortest paths , 1985, STOC '85.
[12] Karsten Weihe,et al. A linear-time algorithm for edge-disjoint paths in planar graphs , 1995, Comb..
[13] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..
[14] Nobuji Saito,et al. A Linear-Time Routing Algorithm for Convex Grids , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[15] Robert E. Tarjan,et al. A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..
[16] Kurt Mehlhorn,et al. Routing Through a Generalized Switchbox , 1986, J. Algorithms.
[17] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..