AWhat changed
Dinitz organized shortest augmenting paths into a maintained layered referent, deleting saturated arcs and dead ends until the shortest source-to-sink distance increases, obtaining an O(n²m) arithmetic-operation maximum-flow bound.
Scientific scope
Dinitz organized shortest augmenting paths into a maintained layered referent, deleting saturated arcs and dead ends until the shortest source-to-sink distance increases, obtaining an O(n²m) arithmetic-operation maximum-flow bound. The original method uses nonnegative capacities, opposite residual arcs and shortest-path referent maintenance. Its O(n^2 m) bound is an arithmetic/machine-operation count, not arbitrary-precision bit complexity or a measured modern runtime. Later DFS and blocking-flow modifications are credited separately. Finite graph tests do not independently certify the original amortized proof for every real-capacity network.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Yefim Dinitz · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- E. A. Dinic, Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation —1970 English translation
- Yefim Dinitz, The Original Version and Even’s Version — author retrospective manuscript
- Yefim Dinitz institutional selected publications: historical E. A. Dinic spelling and 1970 article
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction