A new approach to the maximum-flow problem.

Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum-flow problem. Journal of the ACM, 921-940.

Type

Journal article

Intellectual base

Primary research

Year

1988

Pages

921-940

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/48014.61051matched

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Primes

• Network Flow Models
  • The 1970s-1990s saw algorithmic refinement (push-relabel methods by Goldberg and Tarjan 1988; improved complexity bounds; parametric analyses; Karzanov's preflow-push contributions).

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.

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:81b1583b4a21 · see in the full table