There is a JUnit 5 test class with already four implemented graphs to test the Karger's algorithm with known graphs with known expected results. Each test is made in sequential and multithreading mode ...
Karger, David (1993). "Global Min-cuts in RNC and Other Ramifications of a Simple Mincut Algorithm". Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms.
Abstract: The minimum graph cut and minimum s-t-cut problems are important primitives in the modeling of combinatorial problems in computer science, including in computer vision and machine learning.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results