On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph.

Peng Chen Shigeru Masuyama On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph. 195-199 1994 51 Inf. Process. Lett. 4 db/journals/ipl/ipl51.html#ChenM94 http://dx.doi.org/10.1016/0020-0190(94)00076-X