暂无分享,去创建一个
[1] P. Erdös,et al. Intersection Theorems for Systems of Sets , 1960 .
[2] YOKO KAMIDOI,et al. A Deterministic Algorithm for Finding All Minimum k-Way Cuts , 2006, SIAM J. Comput..
[3] Euiwoong Lee,et al. The Karger-Stein algorithm is optimal for k-cut , 2019, STOC.
[4] Dorit S. Hochbaum,et al. A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..
[5] Shachar Lovett,et al. Improved bounds for the sunflower lemma , 2019, Electron. Colloquium Comput. Complex..
[6] Dorit S. Hochbaum,et al. Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[7] Ken-ichi Kawarabayashi,et al. Deterministic Edge Connectivity in Near-Linear Time , 2014, J. ACM.
[8] Kent Quanrud,et al. LP Relaxation and Tree Packing for Minimum k-Cut , 2020, SIAM J. Discret. Math..
[9] Mikkel Thorup,et al. Minimum k-way cuts via deterministic greedy tree packing , 2008, STOC.
[10] Anupam Gupta,et al. Faster Exact and Approximate Algorithms for k-Cut , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[11] Kent Quanrud,et al. LP Relaxation and Tree Packing for Minimum k-cuts , 2018, SOSA.
[12] David R. Karger,et al. A new approach to the minimum cut problem , 1996, JACM.
[13] Jason Li,et al. Faster Minimum k-cut of a Simple Graph , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[14] Anupam Gupta,et al. The number of minimum k-cuts: improving the Karger-Stein bound , 2019, STOC.
[15] David R. Karger,et al. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.