arXiv (All)
open access
Agentic Algorithm Engineering: Improving Shared-Memory Exact Minimum Cuts
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 the cut edges. Over the last years, we engineered a range of fast algorithms for this problem. Our fastest exact algorithm uses an inexact algorithm t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Decomposition Buys Integrity, Not Yield#1123825
- Decomposition Buys Integrity, Not Yield#919327
- MAS-Algorithm: A Workflow for Solving Algorithmic Programming Problems with a Multi-Agent System#168385
- GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs#1000225
- TGMS: An Agent-Native Bi-Temporal Graph Management System#363360
Record · ID 975257
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive