Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 427

The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.

A Fast Parametric Maximum Flow Algorithm and Applications

Gallo, Giorgio, Grigoriadis, Michael D., Tarjan, Robert E.·1989·SIAM Journal on Computing
DOI 10.1137/0218003
Open this paper in CoChat — free account

Abstract

The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. In this paper it is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound. Faster algorithms for a variety of combinatorial optimization problems follow from the result.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/0218003

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 6

  1. R. K. Ahuja, J. B. Orlin, A fast and simple algorithm for the maximum flow problem, Working Paper, 1905-87, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, 1987
  2. Dinic E. A., 1970, Dokl. Akad. Nauk SSSR, 194, 754
  3. Ford, Jr. L. R., 1962, Flows in networks
  4. Gondran Michel, 1984, Graphs and algorithms
  5. Picard J. C., 1982, INFOR, 20, 394
  6. Ritter K., 1962, Unter-nehmensforschung, 6, 149

Cited by

See all 427

Metadata

Authors
Gallo, G., Grigoriadis, M. D., & Tarjan, R. E.
Venue
SIAM Journal on Computing
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Published
1989-02
Volume
18
Issue
1
Pages
30-55
ISSN
  • 0097-5397
  • 1095-7111
DOI
10.1137/0218003
Cited by
427
References
39
Language
en

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.