Soft x-ray diffraction of striated muscle
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
We describe a simple construction of a family of permutations with a certain pseudo-random property. Such a family can be used to derandomize a recent randomized maximum-flow algorithm of Cheriyan and Hagerup for all relatively dense networks. Hence this supplies a deterministic maximum-flow algorithm that works, on a network with n vertices and m edges, in time O(nm) for all m=Ω(n5/3 log n) (and in time O(nm log n) for all other values of n and m). This improves the running time of the best known deterministic maximum-flow algorithm, due to Goldberg and Tarjan, whose running time is O(nm log(n2/m)). © 1990.
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Fan Zhang, Junwei Cao, et al.
IEEE TETC
B. Wagle
EJOR
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research