The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Finding optimum branchings
Abstract
Chu and Liu, Edmonds, and Bock have independently devised an efficient algorithm to find an optimum branching in a directed graph. We give an implementation of the algorithm which runs in 0(m logn) time if the problem graph has n vertices and m edges. A modification for dense graphs gives a running time of 0(n 2). We also show that the unmodified algorithm runs in 0(n(log n)2 +m) time on an average graph, assuming a uniform probability distribution.
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.
Integrity signals
Registry
Cites
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.
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
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Cited by
Young, H. P. (1993) · Econometrica · doi:10.2307/2951778 · Cited by 2,399
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Gabow, H. N., Galil, Z., Spencer, T., & Tarjan, R. E. (1986) · Combinatorica · doi:10.1007/bf02579168 · Cited by 517
Self-citation
Metadata
- Authors
- Tarjan, R. E.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1977-03
- Volume
- 7
- Issue
- 1
- Pages
- 25-35
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W1988615825
- Cited by
- 365
- References
- 1
- FWCI
- 5.89
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Finding optimum branchings. https://app.cochat.ai/papers/10.1002/net.3230070103
- The paper
- Tarjan, R. E. (1977). Finding optimum branchings. Networks. https://doi.org/10.1002/net.3230070103
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.
