The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Augmentation Problems
Abstract
This paper considers problems in which the object is to add a minimum-weight set of edges to a graph so as to satisfy a given connectivity condition. Simple characterizations of the minimum number of edges necessary to make a directed graph strongly connected and to make an undirected graph bridge-connected or biconnected are given. Efficient algorithms for finding such minimum sets of edges are discussed. It is shown that the weighted versions of these problems are NP-complete.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Self-citationAlgorithm 447: efficient algorithms for graph manipulation
Hopcroft, J., & Tarjan, R. (1973) · Communications of the ACM · doi:10.1145/362248.362272 · Cited by 985
Self-citationEdmonds, 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-citationTarjan, R. E. (1977) · Networks · doi:10.1002/net.3230070103 · Cited by 365
Self-citationA note on finding the bridges of a graph
Tarjan, R. E. (1974) · Information Processing Letters · doi:10.1016/0020-0190(74)90003-9 · Cited by 221
Self-citation
Cited by
Approximation Algorithms for Several Graph Augmentation Problems
Frederickson, G. N., & Ja’Ja’, J. (1981) · SIAM Journal on Computing · doi:10.1137/0210019 · Cited by 259
Metadata
- Authors
- Eswaran, K. P., & Tarjan, R. E.
- Venue
- SIAM Journal on Computing
- Published
- 1976-12
- Volume
- 5
- Issue
- 4
- Pages
- 653-665
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W4234462414
- Cited by
- 313
- References
- 8
- FWCI
- 0.54
- 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.