The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Paths, Trees, and Flowers
Open accessAbstract
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An edge is said to join its end-points. A matching in G is a subset of its edges such that no two meet the same vertex. We describe an efficient algorithm for finding in a given graph a matching of maximum cardinality. This problem was posed and partly solved by C. Berge; see Sections 3.7 and 3.8.
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
The Factorization of Linear Graphs
Tutte, W. T. (1947) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-22.2.107 · Cited by 945
The Theory of Graphs and its Applications.
Harary, F., & Berge, C. (1963) · Biometrika · doi:10.2307/2333777 · Cited by 603
Berge, C. (1957) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.43.9.842 · Cited by 577
Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
Hoffman, A. J. (1960) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/010/0114759 · Cited by 192
An algorithm for a minimum cover of a graph
Norman, R. Z., & Rabin, M. O. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0106853-5 · Cited by 115
Covers and packings in a family of sets
Edmonds, J. (1962) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1962-10791-5 · Cited by 101
Self-citation
Research works printed but not linked: 3
- Ford, 1962, Flows in networks
- Witzgall, 1965, Modification of Edmonds﹜ algorithm for maximum matching of graphs, 69B
- Edmonds, 1965, J. Res. Natl. Bureau Standards, 69B
Cited by
Sorted by citations
Items 401–500 of 1,001
Implementation of O ( nm log n ) weighted matchings in general graphs
Mehlhorn, K., & Schäfer, G. (2002) · ACM Journal of Experimental Algorithmics · doi:10.1145/944618.944622 · Cited by 41
A las vegas rnc algorithm for maximum matching
Karloff, H. J. (1986) · COMBINATORICA · doi:10.1007/bf02579264 · Cited by 41
Separate or joint? Estimation of multiple labels from crowdsourced annotations
Duan, L., Oyama, S., Sato, H., & Kurihara, M. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.03.048 · Cited by 40
Dynamic and self-stabilizing distributed matching
Chattopadhyay, S., Highám, L., & Seyffarth, K. (2002) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/571825.571877 · Cited by 40
Hybrid tractability of valued constraint problems
Cooper, M., & Živný, S. (2011) · Artificial Intelligence · doi:10.1016/j.artint.2011.02.003 · Cited by 39
Fukui, K. (2023) · Physical Review A · doi:10.1103/physreva.107.052414 · Cited by 48
Naddef, D., & Pulleyblank, W. R. (1981) · Discrete Mathematics · doi:10.1016/0012-365x(81)90006-6 · Cited by 39
Altruistically unbalanced kidney exchange
Sönmez, T., & Ünver, M. U. (2014) · Journal of Economic Theory · doi:10.1016/j.jet.2014.04.003 · Cited by 39
Efficient algorithms on context-free graph languages
Lautemann, C. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19488-6_128 · Cited by 39
Leakage suppression in the toric code
Suchara, M., Cross, A. W., & Gambetta, J. M. (2015) · 2015 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282629 · Cited by 38
Tailored XZZX codes for biased noise
Xu, Q., Mannucci, N., Seif, A., Kubica, A., Flammia, S. T., & Jiang, L. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013035 · Cited by 41
Testing for equality between maximum matching and minimum node covering
Gavril, F. (1977) · Information Processing Letters · doi:10.1016/0020-0190(77)90068-0 · Cited by 38
Maximum matchings in a class of random graphs
FRIEZE, A. M. (1986) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(86)90077-8 · Cited by 38
Deep Q-learning decoder for depolarizing noise on the toric code
Fitzek, D., Eliasson, M., Kockum, A. F., & Granath, M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023230 · Cited by 42
Paths, Flowers and Vertex Cover
Raman, V., Ramanujan, M. S., & Saurabh, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23719-5_33 · Cited by 38
Finding maximum square-free 2-matchings in bipartite graphs
Hartvigsen, D. (2006) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2006.01.004 · Cited by 38
Quantum Algorithms for Matching and Network Flows
Ambainis, A., & Špalek, R. (2006) · Lecture notes in computer science · doi:10.1007/11672142_13 · Cited by 38
Maximum Matchings in Planar Graphs via Gaussian Elimination
Mucha, M., & Sankowski, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30140-0_48 · Cited by 38
Interior Point Methods for Combinatorial Optimization
Mitchell, J. E. (1996) · Applied optimization · doi:10.1007/978-1-4613-3449-1_11 · Cited by 38
Spanning subgraphs with specified valencies
Tuttle, W. T. (1974) · Discrete Mathematics · doi:10.1016/0012-365x(74)90075-2 · Cited by 38
Exact Algorithms for Edge Domination
van Rooij, J. M. M., & Bodlaender, H. L. (2011) · Algorithmica · doi:10.1007/s00453-011-9546-x · Cited by 37
Yorke, J. A., & Anderson, W. N. (1973) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.70.7.2069 · Cited by 37
A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
Ngueveu, S. U., Prins, C., & Calvo, R. W. (2009) · Annals of information systems · doi:10.1007/978-1-4419-1306-7_11 · Cited by 37
Cornuéjols, G., & Pulleyblank, W. R. (1983) · COMBINATORICA · doi:10.1007/bf02579340 · Cited by 37
P-selective self-reducibles sets: a new characterization of P
Buhrman, H., van Helden, P., & Torenvliet, L. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/sct.1993.336542 · Cited by 37
Dai, Q., & Gao, Y. (2023) · Artificial intelligence: foundations, theory, and algorithms/Artificial intelligence: Foundations, theory, and algorithms · doi:10.1007/978-981-99-0185-2 · Cited by 40
Computing the Degree of Determinants via Combinatorial Relaxation
Murota, K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539791201897 · Cited by 36
Designing a Million-Qubit Quantum Computer Using a Resource Performance Simulator
Ahsan, M., Meter, R. V., & Kim, J. (2015) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2830570 · Cited by 37
Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
Han, J. (2016) · Transactions of the American Mathematical Society · doi:10.1090/tran/6999 · Cited by 36
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Liang, Y., & Blüm, N. (1995) · Information Processing Letters · doi:10.1016/0020-0190(95)00145-3 · Cited by 36
Sensitivity analysis of optimal matchings
Weber, G. (1981) · Networks · doi:10.1002/net.3230110105 · Cited by 36
On renamable Horn and generalized Horn functions
Chandru, V., Coullard, C. R., Hammer, P. L., Montañez, M., & Sun, X. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531069 · Cited by 36
Quantum Error Correction For Dummies
Chatterjee, A., Phalak, K., & Ghosh, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00017 · Cited by 35
Quantum memories and error correction
Wootton, J. R. (2012) · Journal of Modern Optics · doi:10.1080/09500340.2012.737937 · Cited by 36
Incoherent dynamics in the toric code subject to disorder
Röthlisberger, B., Wootton, J. R., Heath, R. M., Pachos, J. K., & Loss, D. (2012) · Physical Review A · doi:10.1103/physreva.85.022313 · Cited by 34
High-threshold topological quantum error correction against biased noise
Stephens, A. M., Munro, W. J., & Nemoto, K. (2013) · Physical Review A · doi:10.1103/physreva.88.060301 · Cited by 34
Measurement-Free Topological Protection Using Dissipative Feedback
Fujii, K., Negoro, M., Imoto, N., & Kitagawa, M. (2014) · Physical Review X · doi:10.1103/physrevx.4.041039 · Cited by 36
A (2+ϵ)-Approximation for Maximum Weight Matching in the Semi-streaming Model
Paz, A., & Schwartzman, G. (2018) · ACM Transactions on Algorithms · doi:10.1145/3274668 · Cited by 35
Bandwidth steering in HPC using silicon nanophotonics
Michelogiannakis, G., Shen, Y., Teh, M. Y., Meng, X. Z., Aivazi, B., Groves, T., Shalf, J. M., Glick, M. S., Ghobadi, M., Dennison, L. R., et al. (2019) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3295500.3356145 · Cited by 35
Yan, Z., Zhao, K., Li, W., Kang, C., Zheng, J., Yang, H., & Du, S. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3135563 · Cited by 35
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Basu, A., Conforti, M., Summa, M. D., & Jiang, H. (2022) · Mathematical Programming · doi:10.1007/s10107-022-01789-5 · Cited by 35
Matching Algorithms Are Fast in Sparse Random Graphs
Bast, H., Mehlhorn, K., Schäfer, G., & Tamaki, H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24749-4_8 · Cited by 35
Logic and Complexity in Cognitive Science
Isaac, A., Szymanik, J., & Verbrugge, R. (2014) · Outstanding contributions to logic · doi:10.1007/978-3-319-06025-5_30 · Cited by 35
Pairwise Kidney Exchange over the Blood Group Barrier
Andersson, T., & Kratz, J. (2019) · The Review of Economic Studies · doi:10.1093/restud/rdz018 · Cited by 35
A O(|V|·|E|) algorithm for maximum matching of graphs
Kameda, T., & Munro, I. (1974) · Computing · doi:10.1007/bf02239502 · Cited by 35
Dual integrality in b-matching problems
Pulleyblank, W. R. (1980) · Mathematical programming studies · doi:10.1007/bfb0120895 · Cited by 35
A Local Computation Approximation Scheme to Maximum Matching
Mansour, Y., & Vardi, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40328-6_19 · Cited by 34
Polynomial algorithms for a class of linear programs
Maurras, J. F., Truemper, K., & Akgül, M. (1981) · Mathematical Programming · doi:10.1007/bf01584235 · Cited by 34
Rana, J., Singhal, A., Gadre, B. U., Bhalerao, V., & Bose, S. (2017) · The Astrophysical Journal · doi:10.3847/1538-4357/838/2/108 · Cited by 34
Grammar-based graph compression
Maneth, S., & Peternek, F. (2018) · Information Systems · doi:10.1016/j.is.2018.03.002 · Cited by 34
Reinforcement learning for optimal error correction of toric codes
Colomer, L. D., Skotiniotis, M., & Muñoz-Tapia, R. (2020) · Physics Letters A · doi:10.1016/j.physleta.2020.126353 · Cited by 40
Toward silicon-proven detailed routing for analog and mixed-signal circuits
Chen, H., Zhu, K., Liu, M., Tang, X., Sun, N., & Pan, D. Z. (2020) · doi:10.1145/3400302.3415660 · Cited by 34
Storage Capacity of Repairable Networks
Mazumdar, A. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2472521 · Cited by 34
Ordered weighted average combinatorial optimization: Formulations and their properties
Fernández, E., Pozo, M. A., & Puerto, J. (2014) · Discrete Applied Mathematics · doi:10.1016/j.dam.2014.01.001 · Cited by 34
Parallel approximation algorithms for maximum weighted matching in general graphs
Uehara, R., & Chen, Z. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00128-9 · Cited by 34
Bayesian locally optimal design of knockout tournaments
Glickman, M. E. (2007) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2007.09.007 · Cited by 34
A greedy heuristic for a minimum-weight forest problem
Imielińska, C., Kalantari, B., & Khachiyan, L. G. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90097-z · Cited by 34
Algorithmic Cooperative Game Theory
Deng, X., & Fang, Q. (2008) · Springer optimization and its applications · doi:10.1007/978-0-387-77247-9_7 · Cited by 34
Computing Cycle Covers without Short Cycles
Bläser, M., & Siebert, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44676-1_31 · Cited by 34
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
Cheriyan, J. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539793256223 · Cited by 32
On a class of scheduling algorithms for multiprocessors computing systems
Chen, N. F., & Liu, C. L. (1975) · Lecture notes in computer science · doi:10.1007/3-540-07135-0_106 · Cited by 34
Book Review: Computers and intractability: A guide to the theory of $NP$-completeness
Book, R. V. (1980) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1980-14848-x · Cited by 34
Satisfactory graph partition, variants, and generalizations
Bazgan, C., Tuza, Ź., & Vanderpooten, D. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.10.019 · Cited by 36
Quantum versus simulated annealing in wireless interference network optimization
Wang, C., Chen, H., & JONCKHEERE, E. A. (2016) · Scientific Reports · doi:10.1038/srep25797 · Cited by 33
Gu, X., Chen, L., & Krenn, M. (2020) · Physical Review A · doi:10.1103/physreva.101.033816 · Cited by 33
Reducing the Depth of Linear Reversible Quantum Circuits
de Brugiere, T. G., Baboulin, M., Valiron, B., Martiel, S., & Allouche, C. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3091648 · Cited by 36
Decoder for the Triangular Color Code by Matching on a Möbius Strip
Sahay, K., & Brown, B. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010310 · Cited by 38
Local Predecoder to Reduce the Bandwidth and Latency of Quantum Error Correction
Smith, S. C., Brown, B. J., & Bartlett, S. D. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.034050 · Cited by 33
Techniques for combining fast local decoders with global decoders under circuit-level noise
Chamberland, C., Goncalves, L., Sivarajah, P., Peterson, E., & Grimberg, S. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace64d · Cited by 33
Recent Progress in Matching Extension
Plummer, M. D. (2008) · Bolyai Society mathematical studies · doi:10.1007/978-3-540-85221-6_14 · Cited by 33
A decoding algorithm for CSS codes using the X/Z correlations
Delfosse, N., & Tillich, J. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874997 · Cited by 33
One-shot entanglement generation over long distances in noisy quantum networks
Perseguers, S., Jiang, L., Schuch, N., Verstraete, F., Lukin, M. D., Cirac, J. I., & Vollbrecht, K. G. H. (2008) · Physical Review A · doi:10.1103/physreva.78.062324 · Cited by 35
Kidney exchange simulation and optimization
Santos, N., Tubertini, P., Viana, A., & Pedroso, J. P. (2017) · Journal of the Operational Research Society · doi:10.1057/s41274-016-0174-3 · Cited by 33
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
Bläser, M., & Manthey, B. (2005) · Algorithmica · doi:10.1007/s00453-004-1131-0 · Cited by 32
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
Hsu, W., Ikura, Y., & Nemhauser, G. L. (1981) · Mathematical Programming · doi:10.1007/bf01589347 · Cited by 33
Undirected distances and the postman-structure of graphs
Sebö, A. (1990) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(90)90062-5 · Cited by 33
The Square-Free 2-Factor Problem in Bipartite Graphs
Hartvigsen, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48777-8_18 · Cited by 33
Tarjan, R. E. (1974) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800119.803897 · Cited by 33
Goel, G., & Tripathi, P. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.19 · Cited by 32
Adaptive Weight Estimator for Quantum Error Correction in a Time‐Dependent Environment
Spitz, S. T., Tarasinski, B., Beenakker, C. W. J., & O'Brien, T. E. (2018) · Advanced Quantum Technologies · doi:10.1002/qute.201800012 · Cited by 32
Davaasuren, A., Suzuki, Y., Fujii, K., & Koashi, M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033399 · Cited by 39
Algorithms for Convex Optimization
Vishnoi, N. K. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108699211 · Cited by 36
Periodic Multiprocessor Scheduling
Korst, J., Aarts, E., Lenstra, J. K., & Wessels, J. J. (1991) · Lecture notes in computer science · doi:10.1007/978-3-662-25209-3_12 · Cited by 32
Exact ground states of large two-dimensional planar Ising spin glasses
Pardella, G., & Liers, F. (2008) · Physical Review E · doi:10.1103/physreve.78.056705 · Cited by 32
Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs
Chester, S., Gaertner, J. G., Stege, U., & Venkatesh, S. (2012) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2012.74 · Cited by 32
Cosmological lower bound on the circuit complexity of a small problem in logic
Stockmeyer, L. J., & Meyer, A. R. (2002) · Journal of the ACM · doi:10.1145/602220.602223 · Cited by 32
Algebraic Structures and Algorithms for Matching and Matroid Problems
Harvey, N. J. A. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.8 · Cited by 33
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
Chaudhuri, K., Rao, S. B., Riesenfeld, S. J., & Talwar, K. (2007) · Algorithmica · doi:10.1007/s00453-007-9115-5 · Cited by 32
Ground states of two-dimensional ±J Edwards-Anderson spin glasses
Landry, J. W., & Coppersmith, S. N. (2002) · Physical review. B, Condensed matter · doi:10.1103/physrevb.65.134404 · Cited by 32
Decodable hybrid dynamics of open quantum systems with Z2 symmetry
Li, Y., & Fisher, M. P. A. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.214302 · Cited by 41
Fifty-Plus Years of Combinatorial Integer Programming
Cook, W. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_12 · Cited by 30
Branching Quantification v. Two-way Quantification
Gierasimczuk, N., & Szymanik, J. (2009) · Journal of Semantics · doi:10.1093/jos/ffp008 · Cited by 31
Fidelity threshold for long-range entanglement in quantum networks
Perseguers, S. (2010) · Physical Review A · doi:10.1103/physreva.81.012310 · Cited by 31
Nash equilibria in the two-player kidney exchange game
Carvalho, M., Lodi, A., Pedroso, J. P., & Viana, A. (2016) · Mathematical Programming · doi:10.1007/s10107-016-1013-7 · Cited by 31
Chen, Z., Xue, S., Kolen, J. F., Aghdaie, N., Zaman, K. A., Sun, Y., & El‐Nasr, M. S. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3038912.3052559 · Cited by 31
Quantum error-correction failure distributions: Comparison of coherent and stochastic error models
Barnes, J. P., Trout, C. J., Lucarelli, D. G., & Clader, B. D. (2017) · Physical Review A · doi:10.1103/physreva.95.062338 · Cited by 35
Identifying Personal DNA Methylation Profiles by Genotype Inference
Michael Backes, A., Berrang, P., Bieg, M., Eils, R., Herrmann, C., Humbert, M., & Lehmann, I. (2017) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2017.21 · Cited by 32
A scheduling strategy to inter-satellite links assignment in GNSS
Yan, J., Xing, L., Wang, P., Sun, L., & Chen, Y. (2020) · Advances in Space Research · doi:10.1016/j.asr.2020.09.023 · Cited by 31
All-Photonic Architecture for Scalable Quantum Computing with Greenberger-Horne-Zeilinger States
Omkar, S., Lee, S.-H., Teo, Y. S., Lee, S.-W., & Jeong, H. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030309 · Cited by 35
Distributed algorithms for covering, packing and maximum weighted matching
Koufogiannakis, C., & Young, N. E. (2011) · Distributed Computing · doi:10.1007/s00446-011-0127-7 · Cited by 31
Metadata
- Authors
- Edmonds, J.
- Affiliations
- National Institute of Standards and Technology (US)
- Corresponding author
- Edmonds, Jack
- ORCID
- Edmonds, Jack
- Venue
- Canadian Journal of Mathematics
- Publisher
- Canadian Mathematical Society
- Published
- 1965
- Volume
- 17
- Pages
- 449-467
- ISSN
- 0008-414X (ISSN-L)
- 1496-4279
- OpenAlex
- W4233756358
- Cited by
- 2,428
- References
- 6
- Citations by year
- 2026: 80 · 2025: 108 · 2024: 100 · 2023: 110 · 2022: 126 · 2021: 107 · 2020: 134 · 2019: 118 · 2018: 110 · 2017: 91 · 2016: 84 · 2015: 72 · 2014: 83 · 2013: 80 · 2012: 73
- FWCI
- 0.83
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Canadian Journal of Mathematics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- maximum matching, graph theory, matching algorithms, trees, paths, graph algorithms
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
