New near-linear time algorithm to solve the minimum cut problem for undirected graphs
未关闭
algorithm
- 主要语言
- C++
- 星标
- 392
- 派生
- 239
- 平均合并
- 1 天 11 分钟
- 30 天内合并 PR
- 20
描述
Google Research blog post:
https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/
The actual paper:
https://epubs.siam.org/doi/10.1137/1.9781611977912.111
This would presumably be a considerable improvement over our existing Stoer Wagner algorithm.
贡献指南
评估
这个 Issue 还没有评估数据。