Generating Pseudo-Random Permutations and Maximum Flow Algorithms
暂无分享,去创建一个
[1] Harold N. Gabow,et al. Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[2] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[3] Torben Hagerup,et al. A randomized maximum-flow algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] Robert E. Tarjan,et al. Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem , 2008 .
[5] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[6] Ravindra K. Ahuja,et al. A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..