[1] HIROSHI,ISHIKAWA.Global optimization using the DIRECT algorithm in Matlab[J].Matlab Advanced Modeling Optimization,1999,1(2):1-8.
[2] GRIFFING A R,LYNCH B R,STONE E A.Structural properties of the minimum cut of partially-supplied graphs[J].Discrete Applied Mathematics,2014,177(4):152-157.
[3] DAVID R,KARGER,CLIFFORD S.A new approach to the minimum cut problem[J].Journal of the ACM,1996,43(4):601-640.
[4] BHUSHAN G.Sajith.I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs[J].Theoretical Computer Science,2014,43(5):13-15.
[5] EDNAA,HOSHINO.The minimum cut cover problem[J].Electronic Notes in Discrete Mathematics,2011,37(9):255-260.
[6] CONNELLY B,FANG-LUE Z.A survey of the state of the art in patch-based synthesis[J].Computational Visual Media,2017,3(1):3-20.
[7] ORHAN D,VAHID K A,ALI F.A distributed evolutionary algorithm for detecting minimum vertex cuts for wireless ad hoc and sensor networks[J].Journal of Network and Computer Applications,2019,41(1):23-28.
[8] DUAN Q,JINHUI X.On the connectivity preserving minimum cut problem[J].Journal of Computer and System Sciences,2014,80(4):837-848.
[9] MARTIN D,ALAN F,MICHAEL M.A probabilistic analysis of randomly generated binary constraint satisfy-action[J].Theory Computer Science,2003,290(3):1815-1828.
[10] CREIGNOU N,EAUDE H.The SAT-UNSAT transition for random constraint satisfaction problems[J].Discrete Mat-hematics,2009,309(8):2085-2099.
[11] MARTIN OC,MONASSON R,ZECCHINA R.Statistical mechanics methods and phase transitions in optimization[J].Theory Computer Science,2001,265(12):3-67.
[12] 王晓峰,许道云.警示传播算法收敛的充分条件[J].软件学报,2016,27(12):3003-3013. Wang Xiao-feng,Xu Dao-yun.Sufficient conditions convergence of warning propagation algorithm[J].Journal of Software,2016,27(12):3003-3013.(in Chinese)
[13] XU K,Li W.The SAT phase transition[J].Science in China,1999,42(5):494-501.
[14] SHEN Y J.On the phase transitions of random k-constraint satisfaction problems[J].Artificial Intelligence,2011,17-5(3-4):914-927.
[15] ACHLIOPTAS D,NARO A,Peres Y.Rigorous location of phase transitions in hard optimization problems[J].Nature,2005,435(7043):759-764.
[16] MERTENS S,MEZARD M,ZECCHINA R.Threshold values of random k-SAT from the cavity method[J].Random Structure Algorithms,2006,28(3):340-373.
[17] MEZARD M,PARISI G.The cavity method at zero temperature[J].Journal of Statistical Physics,2003,111(1-2):1-34.
[18] MEZARD M,ZECCHINA R.Random k-satisfiability problem from an analytic solution to an efficient algorithm[J].Physical Review,2002,66(5):056-126.
[19] MANEVA E,MOSSEL E,WAINWRIGHT M.A new look at survey propagation and its generalizations[J].Journal of the ACM,2007,54(4):1089-1098.
[20] BRAUNSTEIN A,MEZARD M,MEZARD R.Survey propagation:an algorithm for satisfiability[J].Random Structures and Algorithms,2005,27(2):201-226.
[21] BRAUNSTEIN A,ZECCHINA R.Survey and belief propagation on random k-SAT[J].Lecture Notes in Computer Science,2004,2919(1):519-528.
[22] YEDIDIA JS,FREEMAN WT,WEISS Y.Understanding belief propagation and its generalizations[J].Artificial Intelligence,2003,8(1):239-269.
[23] MEZARD M,PARISI G,ZECCHINA R.Analytic and algorithmic solution of random satisfiability problems[J].Science,2002,297(5582):812-815.
[24] BOUSSEMART K,HEMERY F F,et al.Random constraint satisfaction[J].Easy Generation of Hard Instance Artificial Intelligence,2007,171(1):514-534. |