暂无分享,去创建一个
[1] D. Karger,et al. Random sampling in graph optimization problems , 1995 .
[2] David R. Karger,et al. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.
[3] R. Bixby. The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds , 1974, Networks.
[4] David R. Karger,et al. A new approach to the minimum cut problem , 1996, JACM.
[5] N. Wormald. The differential equation method for random graph processes and greedy algorithms , 1999 .
[6] L. Sunil Chandran,et al. On the Number of Minimum Cuts in a Graph , 2002, COCOON.
[7] David R. Karger,et al. Minimum cuts in near-linear time , 1998, JACM.
[8] Leslie Ann Goldberg,et al. Approximating the Partition Function of the Ferromagnetic Potts Model , 2010, ICALP.
[9] Ahmad R. Sharafat,et al. All-Terminal Network Reliability Using Recursive Truncation Algorithm , 2009, IEEE Transactions on Reliability.
[10] Michael Werman,et al. Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[11] David R. Karger,et al. Implementing a fully polynomial time approximation scheme for all terminal network reliability , 1997, SODA '97.
[12] Richard M. Karp,et al. Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.
[13] David R. Karger,et al. A Fast and Simple Unbiased Estimator for Network (Un)reliability , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[14] David R. Karger,et al. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem , 1995, STOC '95.