Shared-memory parallel minimum cut algorithms (inexact, exact, cactus, multiterminal)
Python Frontend to Algorithms of the Algorithm Engineering Group Heidelberg
The open closed-loop OS for gamma-entrainment research — a Rust/WASM/edge harness to measure, adapt & compare 40 Hz multisensory stimulation protocols with signed, reproducible evidence. Research-grade, not a medical device.
An implementation for Karger Minimum cut algorithem
Exact minimum cuts in hypergraphs at scale using FPT kernelization
Weighted connectivity augmentation algorithms: heuristics, local search, and ILP-based exact approaches
Academical implementation of Karger's Algorithm in O(mα(n) + n) and Karger-Stein algorithm in O((mα(n) + n) log(n)) using the Union-Find data structure.
OOP and Functional Implementations of Karger's Graph Minimum Cut Algorithm
A solver to the minimum cut problem of a graph.
Implementations of classic graph algorithms across three assignments
Coursera algorithms 2 (from Princeton Uni)
Karger’s Algorithm is a Randomised Algorithm used to Find the Minimum Cut (Min-Cut) of a Connected, Undirected Graph. It is Celebrated for its Simplicity and for Being a Classic example of a "Monte Carlo" Algorithm—One that is Fast and Usually Correct, but has a Small Chance of Failing
An implementation of "Exact Maximum A Posteriori Estimation for Binary Images" (D. Greig, B. Porteous and A. Seheult)
A simple, self-contained minimum cut implementation in C99
Community detection in VK
randomized Karger's algorithm for min-cut
Add a description, image, and links to the minimum-cut topic page so that developers can more easily learn about it.
To associate your repository with the minimum-cut topic, visit your repo's landing page and select "manage topics."