Max flows in O(VE) or better.

Orlin, J. B. (2013). Max flows in O(VE) or better. STOC 2013 Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 765-774.

Type

Conference paper

Intellectual base

Primary research

Year

2013

Pages

765-774

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/2488608.2488705 not authoritativefound

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Primes

• Network Flow Models
  • The 2000s-2020s have seen renewed theoretical progress including Orlin's (2013) result improving min-cost-flow complexity and the 2022 Chen-Kyng-Liu-Peng-Gutenberg-Sachdeva near-linear-time max-flow algorithm — a major breakthrough after decades.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:9d099d588402 · see in the full table