The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
Abstract
Define the length of a basis of the cycle space of a graph to be the sum of the lengths of all cycles in the basis. An algorithm is given that finds a cycle basis with the shortest possible length in $O(m^3 n)$ operations, where m is the number of edges and n is the number of vertices. This is the first known polynomial-time algorithm for this problem. Edges may be weighted or unweighted. Also, the shortest cycle basis is shown to have at most ${{3(n - 1)(n - 2)} / 2}$ edges for the unweighted case. $O(mn^2 )$ algorithm to obtain a suboptimal cycle basis of length $O(n^2 )$ for unweighted graphs is also given.
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
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
On Algorithms for Enumerating All Circuits of a Graph
Mateti, P., & Deo, N. (1976) · SIAM Journal on Computing · doi:10.1137/0205007 · Cited by 195
Sysło, M. M. (1979) · Networks · doi:10.1002/net.3230090203 · Cited by 39
Research works printed but not linked: 12
- 10.1109/TCT.1973.1083752 · doi:10.1109/tct.1973.1083752
- Cribb D. W., 1981, Congr. Numer., 32, 221
- 10.1109/TCS.1979.1084563 · doi:10.1109/tcs.1979.1084563
- 10.1145/355984.355988 · doi:10.1145/355984.355988
- 10.1002/net.3230060206 · doi:10.1002/net.3230060206
- Hubicka Elżbieta, 1975, Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), 283
- D. E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1968, 363–3700191.17903
- Kolasinska E., 1980, Zastos. Mat., 16, 631
- 10.1145/363219.363232 · doi:10.1145/363219.363232
- P. Steeves, Ph.D. Thesis, Numerical processing of horizontal control data-economization by automation, University of New Brunswick, 1984
- Stepanec G. F., 1964, Uspehi Mat. Nauk, 19, 171
- 10.1137/0210062 · doi:10.1137/0210062
Cited by
Bohland, J. W., Saperstein, S., Pereira, F., Rapin, J., & Grady, L. (2012) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2012.00078 · Cited by 64
igraph 1.0 enables fast and robust network analysis across programming languages
Antonov, M., Csárdi, G., Horvát, S., Müller, K., Nepusz, T., Noom, D., Salmon, M., Traag, V., Welles, B. F., & Zanini, F. (2026) · PLOS One · doi:10.1371/journal.pone.0355108 · Cited by 56
Metadata
- Authors
- Horton, J. D.
- Venue
- SIAM Journal on Computing
- Published
- 1987-04
- Volume
- 16
- Issue
- 2
- Pages
- 358-366
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1966878439
- Cited by
- 288
- References
- 4
- FWCI
- 2.35
- 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.