New near-linear time algorithm to solve the minimum cut problem for undirected graphs
Open
algorithm
- Dominant language
- C++
- Stars
- 392
- Forks
- 239
- Avg merge
- 1d 11m
- Merged PRs (30d)
- 20
Description
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.
Contributor guide
Assessment
This issue has not been assessed yet.