Simplifying Flow Networks
暂无分享,去创建一个
[1] Samir Khuller,et al. The Lattice Structure of Flow in Planar Graphs , 1993, SIAM J. Discret. Math..
[2] Karsten Weihe. Maximum (s,t)-flows in planar networks in O(|V|log|V|) time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[3] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[4] Alexander Schrijver,et al. Finding k Disjoint Paths in a Directed Planar Graph , 1994, SIAM J. Comput..
[5] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[6] K. Weihe. Maximum (s,t)-Flows in Planar Networks in O( , 1997 .
[7] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[8] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .