[3] Bencziir, A.A., A representation of cuts within 6/5 times the edge connectivity with applications, Proc. ... [4] Bencztir, A.A., Cut structures and randomized algorithms in edge-connectivity problems, Ph.D. Thesis, Massachusetts lnstitute of Technology (1997). Available at http: ... [9] Ford, L.R. and D.R. Fulkerson, Maximal flow through a network, Canadian Joumal of Mathematics 8 (1956), 399404. Fordanbsp;...

Title | : | Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms |

Author | : | |

Publisher | : | - 1998 |

Continue