Edge-Disjoint Paths in Planar Graphs with Short Total Length
暂无分享,去创建一个
[1] Barbara Wolfers,et al. Short Wire Routing in Convex Grids , 1991, ISA.
[2] Nobuji Saito,et al. An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks , 1985, SIAM J. Comput..
[3] Karsten Weihe,et al. A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs , 1993, ESA.
[4] Dorothea Wagner. Optimal routing through dense chanels , 1993, Int. J. Comput. Geom. Appl..
[5] Michael Kaufmann,et al. A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs , 1991, ISA.
[6] Dorothea Wagner,et al. Routing through a dense channel with minimum total wire length , 1991, SODA '91.
[7] Haruko Okamura,et al. Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.
[8] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..