1. Lecture Notes in Computer Science;U. Brandes,2001
2. Lecture Notes in Computer Science;S. Cornelsen,2003
3. Lecture Notes in Computer Science;G. Battista Di,2002
4. Dinitz, Y., Karzanov, A.V., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. In: Fridman, A. (ed.) Studies in Discrete Optimization, Nauka, pp. 290–306 (1976) (in Russian)
5. Dinitz, Y., Nutov, Z.: A 2-level cactus model for the system of minimum and minimum+1 edge–cuts in a graph and its incremental maintenance. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC 1995), pp. 509–518. ACM, The Association for Computing Machinery, New York (1995)