1. A. A. Benczur, “Augmenting undirected connectivity in O(n3) time”, Proc. 26th Annual ACM Symp. on Theory of Computing, ACM Press, 1994, 658–667.
2. A. A. Benczur, “The structure of near-minimum edge cuts”, In Proc. 36st Annual Symp. on Foundations of Computer Science, 1995, 92–102.
3. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms, McGraw-Hill, New York, NY, 1990.
4. Lect Notes Comput Sci;Ye. Dinitz,1993
5. Ye. Dinitz, “The 3-edge components and the structural description of edge cuts in a graph”, Manuscript.