arXiv (All)
open access
A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows
We present formalisations of the correctness of executable algorithms to solve minimum-cost flow problems in Isabelle/HOL. Two of the algorithms are based on the technique of scaling, most notably Orlin's algorithm, which has the fastest known running time for solving the problem of minimum-cost flo
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
- Schwarz: Solver-Aware Agentic Program Verification#818849
- Schwarz: Solver-Aware Agentic Program Verification#808857
- CVE-2026-75804 — MEDIUM 5.3#1147581
- A Formal Semantics of C with OpenMP Parallelism#229466
- From TinyGo to gc Compiler: Extending Zorya's Concolic Framework to Real-World Go Binaries#155367
Record · ID 1011038
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