N. Alon, A Note on Network Reliability, Discrete Probability and Algorithms, pp.11-14, 1995.
DOI : 10.1007/978-1-4612-0801-3_2
URL : http://www.cs.tau.ac.il/~nogaa/PDFS/connect.pdf

A. A. Benczúr and D. R. Karger, ) time, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.47-55, 1996.
DOI : 10.1145/237814.237827

B. Bollobás, Random graphs, 1998.

K. Censor-hillel, M. Ghaffari, and F. Kuhn, Distributed connectivity decomposition, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.156-165, 2014.
DOI : 10.1145/2611462.2611491
URL : http://arxiv.org/pdf/1311.5317.pdf

K. Censor-hillel, M. Ghaffari, and F. Kuhn, A New Perspective on Vertex Connectivity, Proc. 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.546-561, 2014.
DOI : 10.1137/1.9781611973402.41
URL : http://groups.csail.mit.edu/tds/papers/Ghaffari/Vertexconn.pdf

A. Kanevsky, On the number of minimum size separating vertex sets in a graph and how to find all of them, Proc. 1st ACM-SIAM Symposium on Discrete Algorithm (SODA), pp.411-421, 1990.

D. R. Karger, Global min-cuts in RN C, and other ramifications of a simple mincut algorithm, Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.21-30, 1993.

D. R. Karger, Random sampling in cut, flow, and network design problems, Proc. 26th ACM Symposium on Theory of Computing (STOC), pp.648-657, 1994.
DOI : 10.1145/195058.195422

D. R. Karger, Using randomized sparsification to approximate minimum cuts, Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.424-432, 1994.

D. R. Karger, A randomized fully polynomial time approximation scheme for the all terminal network reliability problem, Proc. 27th ACM Symposium on Theory of Computing (STOC), pp.11-17, 1995.

D. R. Karger and M. S. Levine, Finding maximum flows in undirected graphs seems easier than bipartite matching, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.69-78, 1998.
DOI : 10.1145/276698.276714
URL : http://people.csail.mit.edu/karger/Papers/stoc98.pdf

M. V. Lomonosov and V. P. Polesskii, Lower bound of network reliability, Problems of Information Transmission, vol.8, pp.118-123, 1972.

C. S. Nash-williams, Edge-Disjoint Spanning Trees of Finite Graphs, Journal of the London Mathematical Society, vol.1, issue.1, pp.445-450, 1961.
DOI : 10.1112/jlms/s1-36.1.445

D. A. Spielman and S. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.81-90, 2004.
DOI : 10.1145/1007352.1007372

W. T. Tutte, Connected Factors, Journal of the London Mathematical Society, vol.1, issue.1, pp.221-230, 1961.
DOI : 10.1112/jlms/s1-36.1.221

A. Zehavi and A. Itai, Three tree-paths, Journal of Graph Theory, vol.13, issue.2, pp.175-188, 1989.
DOI : 10.1007/978-1-349-03521-2