The DOI matches its Crossref record; 10 of the 10 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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Self-citationShortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Self-citationThe Art of Computer Programming, Vol. 3: Sorting and Searching
McClellan, M. T., Minker, J., & Knuth, D. E. (1974) · Mathematics of Computation · doi:10.2307/2005383 · Cited by 910
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
Finding Minimum Spanning Trees
Cheriton, D. R., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205051 · Cited by 428
Self-citationA simple derivation of edmonds' algorithm for optimum branchings
Karp, R. M. (1971) · Networks · doi:10.1002/net.3230010305 · Cited by 97
Cited by
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 2,656
Self-citationYoung, H. P. (1993) · Econometrica · doi:10.2307/2951778 · Cited by 2,399
Learning Bayesian networks: The combination of knowledge and statistical data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1007/bf00994016 · Cited by 2,017
GrapeTree: visualization of core genomic relationships among 100,000 bacterial pathogens
Zhou, Z., Alikhan, N.-F., Sergeant, M. J., Luhmann, N., Vaz, C., Francisco, A. P., Carriço, J. A., & Achtman, M. (2018) · Genome Research · doi:10.1101/gr.232397.117 · Cited by 1,060
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
- 10
- 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
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.