1. A. A. Benczúr. A representation of cuts within 6/5 times the edge connectivity with applications. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS’ 95), pages 92–103. IEEE Computer Society Press, 1995.
2. Lect Notes Comput Sci;U. Brandes,2001
3. Lect Notes Comput Sci;Y. Dinitz,1993
4. Y. Dinitz, A. V. Karzanov, and M. Lomonosov. On the structure of a family of minimal weighted cuts in a graph. In A. Fridman, editor, Studies in Discrete Optimization, pages 290–306. Nauka, 1976. (in Russian).
5. Y. Dinitz and Z. Nutov. 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’ 95), pages 509–518. ACM, The Association for Computing Machinery, 1995.