The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Finding a Minimum Circuit in a Graph
Abstract
Finding minimum circuits in graphs and digraphs is discussed. An almost minimum circuit is a circuit which may have only one edge more than the minimum. To find an almost minimum circuit an $O(n^2 )$ algorithm is presented. A direct algorithm for finding a minimum circuit has an $O(ne)$ behavior. It is refined to yield an $O(n^2 )$ average time algorithm. An alternative method is to reduce the problem of finding a minimum circuit to that of finding a triangle in an auxiliary graph. Three methods for finding a triangle in a graph are given. The first has an $O(e^{3/2})$ worst case bound ($O(n)$ for planar graphs); the second takes $O(n^{5/3})$ time on the average; the third has an $O(n^{\log 7} )$ worst case behavior. For digraphs, results of Bloniarz, Fisher and Meyer are used to obtain an algorithm with $O(n^2 \log n)$ average behavior.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
INTRODUCTION TO COMBINATORIAL MATHEMATICS
Williamson, S. G. (1969) · Bulletin of the London Mathematical Society · doi:10.1112/blms/1.3.431 · Cited by 444
Cited by
Alon, N., Yuster, R., & Zwick, U. (1995) · Journal of the ACM · doi:10.1145/210332.210337 · Cited by 1,002
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
Finding and counting given length cycles
Alon, N., Yuster, R., & Zwick, U. (1997) · Algorithmica · doi:10.1007/bf02523189 · Cited by 608
Fomin, F. V., & Kratsch, D. (2010) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/978-3-642-16533-7 · Cited by 471
Main-memory triangle computations for very large (sparse (power-law)) graphs
Latapy, M. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.07.017 · Cited by 458
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
Bar-Yehuda, R., & Even, S. (1985) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73101-3 · Cited by 404
Tillmann, A. M., & Pfetsch, M. E. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2290112 · Cited by 389
A new algorithm for optimal 2-constraint satisfaction and its implications
Williams, R. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.023 · Cited by 386
Worst-case optimal join algorithms: [extended abstract]
Ngo, H. Q., Porat, E., Ré, C., & Rudra, A. (2012) · Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems · doi:10.1145/2213556.2213565 · Cited by 324
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
Schank, T., & Wagner, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11427186_54 · Cited by 319
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Becchetti, L., Boldi, P., Castillo, C., & Gionis, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401898 · Cited by 319
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
Abboud, A., & Williams, V. V. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.53 · Cited by 268
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
Gall, F. L. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.31 · Cited by 56
Metadata
- Authors
- Itai, A., & Rodeh, M.
- Venue
- SIAM Journal on Computing
- Published
- 1978-11
- Volume
- 7
- Issue
- 4
- Pages
- 413-423
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1991858502
- Cited by
- 391
- References
- 4
- FWCI
- 1.66
- 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.