1. 1) BOROS E. Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems. Integer Programming and Combinatorial Optimization, 10th International Conference, New York, NY, USA, 2004. Springer. (2004)
2. 2) COULBOURN C. J. The Combinatorics of Network Reliability. Oxford University Press. (1987)
3. 3) EITER T. Computational Aspects of monotone dualization : a brief survey. Institut fur Informationssysteme, TU Wien. (2006)
4. 4) ISHII T. Optimal augmentation to make a graph k-edge-connected and triconnected. Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms. San Francisco, California, United States, 1998. (1998)
5. 5) KHACHIYAN L. Generating cut conjunctions and bridge avoiding extensions in graphs. ISAAC 2005, the 16th International Symposium on Algorithms and Computation, Hainan, China, December 19-21, 2005. Springer. (2005)