Agentic Algorithm Engineering: Improving Shared-Memory Exact Minimum Cuts
arXiv:2609.07204v1 Announce Type: new Abstract: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of th