Gal Badishi, Idit Keidar, et al.
IEEE TDSC
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.
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum