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 901–1,000 of 1,001
Converting MST to TSP Path by Branch Elimination
Fränti, P., Nenonen, T., & Yuan, M. (2020) · Applied Sciences · doi:10.3390/app11010177 · Cited by 12
On complexity of special maximum matchings constructing
Kamalian, R. R., & Mkrtchyan, V. (2007) · Discrete Mathematics · doi:10.1016/j.disc.2007.04.029 · Cited by 12
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
Szymańska, E. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10217-2_43 · Cited by 12
Integer programming formulations for the minimum weighted maximal matching problem
Taşkın, Z. C., & Ekim, T. (2011) · Optimization Letters · doi:10.1007/s11590-011-0351-x · Cited by 12
Optimizing regenerator cost in traffic grooming
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., & Zaks, S. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.09.023 · Cited by 12
Tree Search and Quantum Computation
Wichert, A. (2016) · Cited by 12
A Network Augmenting Path Basis Algorithm for Transshipment Problems
Barr, R. S., Elam, J. J., Glover, F., & Klingman, D. D. (1980) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-46414-0_12 · Cited by 12
Quasimonotone Boolean Functions and Bistellar Graphs
Hammer, P. L., & Simeone, B. (1980) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70043-8 · Cited by 12
On the complexity of solving feasible systems of linear inequalities specified with approximate data
Filipowski, S. (1995) · Mathematical Programming · doi:10.1007/bf01590957 · Cited by 12
Scheduling: Bibliography & Review
King, J. R., & Spachis, A. S. (1980) · International Journal of Physical Distribution & Materials Management · doi:10.1108/eb014469 · Cited by 12
Unique maximum matching algorithms
Gabow, H. N., Kaplan, H. Y., & Tarjan, R. E. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301273 · Cited by 12
Maximum internally stable sets of a graph
Hakimi, S. L., & Frank, H. (1969) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(69)90233-9 · Cited by 12
Agent-Q: Fine-Tuning Large Language Models for Quantum Circuit Generation and Optimization
Jern, L., Uotila, V., Yu, C., & Zhao, B. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00179 · Cited by 13
Exponential lifetime improvement in topological quantum memories
Bardyn, C.-E., & Karzig, T. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.94.094303 · Cited by 11
Shutty, N., & Chamberland, C. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.014072 · Cited by 15
Maximizing Entanglement Rates via Efficient Memory Management in Flexible Quantum Switches
Promponas, P., Valls, V., Guha, S., & Tassiulas, L. (2024) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2024.3380097 · Cited by 13
Continuous error correction for Ising anyons
Hutter, A., & Wootton, J. R. (2016) · Physical Review A · doi:10.1103/physreva.93.042327 · Cited by 11
Merging network patterns: a general framework to summarize biomedical network data
Xiang, Y., Fuhry, D., Kaya, K., Jin, R., Çatalyürek, Ü. V., & Huang, K. (2012) · Network Modeling Analysis in Health Informatics and Bioinformatics · doi:10.1007/s13721-012-0009-3 · Cited by 11
Polynomial-time approximation algorithms for the coloring problem in some cases
Malyshev, D. S. (2016) · Journal of Combinatorial Optimization · doi:10.1007/s10878-016-0008-x · Cited by 11
Advances in co-volume mesh generation and mesh optimisation techniques
Walton, S. P., Hassan, O., & Morgan, K. P. (2016) · Computers & Structures · doi:10.1016/j.compstruc.2016.06.009 · Cited by 11
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
Ahat, B., Ekim, T., & Taşkın, Z. C. (2017) · INFORMS journal on computing · doi:10.1287/ijoc.2017.0764 · Cited by 11
Minimum cost perfect matching with delays for two sources
Emek, Y., Shapiro, Y., & Wang, Y. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.07.004 · Cited by 11
Workspace exploration and protection with multiple robots assisted by sensor networks
Kim, J. (2018) · International Journal of Advanced Robotic Systems · doi:10.1177/1729881418792170 · Cited by 11
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0010 · Cited by 12
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
Bhattacharya, S., Kiss, P., Saranurak, T., & Wajc, D. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977554.ch5 · Cited by 11
Leverrier, A., & Zémor, G. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977554.ch45 · Cited by 13
On the Degree of Parallelism in Real-Time Scheduling of DAG Tasks
He, Q., Guan, N., Lv, M., & Gu, Z. (2023) · Design, Automation, and Test in Europe · doi:10.23919/date56975.2023.10137259 · Cited by 11
Actis: A Strictly Local Union–Find Decoder
Chan, T., & Benjamin, S. C. (2023) · Quantum · doi:10.22331/q-2023-11-14-1183 · Cited by 11
Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ
King, A. D., & Reed, B. A. (2014) · Journal of Graph Theory · doi:10.1002/jgt.21797 · Cited by 11
Approximating the bottleneck plane perfect matching of a point set
Abu-Affash, A. K., Biniaz, A., Carmi, P., Maheshwari, A., & Smid, M. (2015) · Computational Geometry · doi:10.1016/j.comgeo.2015.06.005 · Cited by 11
The real truth about star designs
Hoffman, D. G. (2004) · Discrete Mathematics · doi:10.1016/j.disc.2004.02.002 · Cited by 11
Balancing Production and Distribution in Paper Manufacturing
Geismar, H. N., & Murthy, N. M. (2014) · Production and Operations Management · doi:10.1111/poms.12314 · Cited by 11
Wang, X., Song, X., & Yuan, J. (2013) · Mathematical Programming · doi:10.1007/s10107-013-0731-3 · Cited by 11
Finding Independent Sets inK4-Free 4-Regular Connected Graphs
Locke, S. C., & Lou, F. (1997) · Journal of Combinatorial Theory Series B · doi:10.1006/jctb.1997.1772 · Cited by 11
Assigning cameras to subjects in video surveillance systems
El-alfy, H. M., Jacobs, D. W., & Davis, L. S. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2009.5152753 · Cited by 11
Routing and spectrum allocation in multi-ring based data center networks
Zhang, Z., Hu, W., Ye, T., Sun, W., Zhao, L., & Zhang, K. (2015) · Optics Communications · doi:10.1016/j.optcom.2015.09.097 · Cited by 11
One-loop diagrams in the random Euclidean matching problem
Lucibello, C., Giorgio Parisi, A., & Sicuro, G. (2017) · Physical review. E · doi:10.1103/physreve.95.012302 · Cited by 11
Deterministic Min-Cost Matching with Delays
Azar, Y., & Fanani, A. J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-04693-4_2 · Cited by 11
Bilali, A., Dandl, F., Fastenrath, U., & Bogenberger, K. (2019) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2019.8917280 · Cited by 11
Loyalty in Cardinal Hedonic Games
Bullinger, M., & Kober, S. (2021) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/10 · Cited by 13
High variation-tolerant obstacle-avoiding clock mesh synthesis with symmetrical driving trees
Shih, X.-W., Lee, H.-C., Ho, K.-H., & Chang, Y. (2010) · doi:10.1109/iccad.2010.5653754 · Cited by 11
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
Hanauer, K., Henzinger, M. R., Schmid, S., & Trummer, J. (2022) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom48880.2022.9796921 · Cited by 11
Survivable free space optical mesh network using high-altitude platforms
Truong, D. L., Dang, X. V., & Dang, N. T. (2022) · Optical Switching and Networking · doi:10.1016/j.osn.2022.100716 · Cited by 11
Processor efficient parallel matching
Sankowski, P. (2005) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1073970.1073994 · Cited by 11
An efficient distributed algorithm for maximum matching in general graphs
Wu, M. M., & Loui, M. C. (1990) · Algorithmica · doi:10.1007/bf01840395 · Cited by 11
Graph labelings derived from models in distributed computing: A complete complexity classification
Chalopin, J., & Paulusma, D. (2011) · Networks · doi:10.1002/net.20432 · Cited by 11
Finding augmenting chains in extensions of claw-free graphs
Hertz, A., Lozin, V., & Schindl, D. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(03)00223-0 · Cited by 11
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution
Roussel, F., Rusu, I., & Thuillier, H. (2009) · Discrete Mathematics · doi:10.1016/j.disc.2009.05.024 · Cited by 11
Martinelli, R., & Contardo, C. (2015) · INFORMS journal on computing · doi:10.1287/ijoc.2015.0649 · Cited by 11
Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs
Chrobák, M., Naor, J. S., & Novick, M. B. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51542-9_13 · Cited by 11
Shokoufandeh, A., Marsic, I., & Dickinson, S. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1998.710777 · Cited by 11
Finding thet-join structure of graphs
Sebö, A. (1986) · Mathematical Programming · doi:10.1007/bf02592020 · Cited by 11
Homomorphic Logical Measurements
Huang, S., Jochym-O’Connor, T., & Yoder, T. J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030301 · Cited by 10
Enhanced Message-Passing Decoding of Degenerate Quantum Codes Utilizing Trapping Set Dynamics
Chytas, D., Pacenti, M., Raveendran, N., Flanagan, M. F., & Vasic, B. V. (2024) · IEEE Communications Letters · doi:10.1109/lcomm.2024.3356312 · Cited by 10
Beyond leagues: A single incomplete round robin tournament for multi-league sports timetabling
Li, M., Bulck, D. V., & Goossens, D. R. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2024.11.007 · Cited by 10
Boland, N., Kalinowski, T., & Kaur, S. (2015) · Journal of Combinatorial Optimization · doi:10.1007/s10878-015-9910-x · Cited by 10
On the recognition of fuzzy circular interval graphs
Oriolo, G., Pietropaoli, U., & Stauffer, G. (2012) · Discrete Mathematics · doi:10.1016/j.disc.2011.12.029 · Cited by 10
Protein complex prediction based on maximum matching with domain–domain interaction
Ma, W., McAnulla, C., & Wang, L. (2012) · Biochimica et Biophysica Acta (BBA) - Proteins and Proteomics · doi:10.1016/j.bbapap.2012.06.009 · Cited by 10
On average lower independence and domination numbers in graphs
Blidia, M., Chellali, M., & Maffray, F. (2005) · Discrete Mathematics · doi:10.1016/j.disc.2004.12.006 · Cited by 10
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
David Coudert, A., Ducoffe, G., & Popa, A. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975031.176 · Cited by 10
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
Klopp, A., & Steffen, E. (2021) · Graphs and Combinatorics · doi:10.1007/s00373-020-02266-6 · Cited by 10
Machine-Learning based Decoding of Surface Code Syndromes in Quantum Error Correction
Bhoumik, D., Sen, P., Majumdar, R., Sur‐Kolay, S., Latesh Kumar, K. J., & Iyengar, S. S. (2022) · Journal of Engineering Research and Sciences · doi:10.55708/js0106004 · Cited by 10
Spectral extrema of graphs with bounded clique number and matching number
Wang, H., Hou, X., & Ma, Y. (2023) · Linear Algebra and its Applications · doi:10.1016/j.laa.2023.03.026 · Cited by 10
Generic goal-oriented design for layout and cutting of floor tiles
Xu, Y., Wang, J., & Yang, Z. (2023) · Automation in Construction · doi:10.1016/j.autcon.2023.104903 · Cited by 10
Measurement-based quantum simulation of Abelian lattice gauge theories
Sukeno, H., & Okuda, T. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.5.129 · Cited by 13
Reconstruction of an ancestral Yersinia pestisgenome and comparison with an ancient sequence
Duchemin, W., Daubin, V., & Tannier, É. (2015) · BMC Genomics · doi:10.1186/1471-2164-16-s10-s9 · Cited by 13
Matroids Induced by Packing Subgraphs
Janata, M. (2004) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480102379830 · Cited by 10
Georgiadis, G., & Papatriantafilou, M. (2013) · Algorithms · doi:10.3390/a6040824 · Cited by 10
A fast matching algorithm for asymptotically optimal distributed channel assignment
Naparstek, O., & Leshem, A. (2013) · IEEE International Conference on Digital Signal Processing (DSP) · doi:10.1109/icdsp.2013.6622738 · Cited by 10
Stabilizing Network Bargaining Games by Blocking Players
Ahmadian, S., Hosseinzadeh, H., & Sanità, L. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-33461-5_14 · Cited by 10
Minimum Cost Perfect Matching with Delays for Two Sources
Emek, Y., Shapiro, Y., & Wang, Y. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-57586-5_18 · Cited by 10
Data Reduction for Maximum Matching on Real-World Graphs
Koana, T., Korenwein, V., Nichterlein, A., Niedermeier, R., & Zschoche, P. (2021) · ACM Journal of Experimental Algorithmics · doi:10.1145/3439801 · Cited by 10
Breuer, M., Meyer, U., & Wetzel, S. (2022) · ACM Conference on Data and Application Security and Privacy (CODASPY) · doi:10.1145/3508398.3511509 · Cited by 10
Meuli, G., Soeken, M., Roetteler, M., Wiebe, N., & Micheli, G. D. (2018) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2018.8297398 · Cited by 10
Integer programming models for round robin tournaments
van Doornmalen, J., Hojny, C., Lambers, R., & Spieksma, F. C. R. (2023) · European Journal of Operational Research · doi:10.1016/j.ejor.2023.02.017 · Cited by 10
Exploring the tractability border in epistemic tasks
Dégremont, C., Kurzen, L. M., & Szymanik, J. (2012) · Synthese · doi:10.1007/s11229-012-0215-7 · Cited by 10
On the 2-Resonance of Fullerenes
Kaiser, T., Stehlı́k, M., & Škrekovski, R. (2011) · SIAM Journal on Discrete Mathematics · doi:10.1137/10078699x · Cited by 10
Optimizing glassy p -spin models
Thomas, C. K., & Katzgraber, H. G. (2011) · Physical Review E · doi:10.1103/physreve.83.046709 · Cited by 10
Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs
Meghanathan, N. (2015) · The Computer Journal · doi:10.1093/comjnl/bxv102 · Cited by 10
From matchings to independent sets
Lozin, V. (2016) · Discrete Applied Mathematics · doi:10.1016/j.dam.2016.04.012 · Cited by 10
A robust combinatorial approach to reduce singularities in quadrilateral meshes
Verma, C. S., & Suresh, K. (2016) · Computer-Aided Design · doi:10.1016/j.cad.2016.07.008 · Cited by 10
A generalized partite-graph method for transportation data association
Anderson, P., & Farooq, B. (2017) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2017.01.004 · Cited by 10
The stochastic stability of decentralized matching on a graph
Boncinelli, L., & Pin, P. (2017) · Games and Economic Behavior · doi:10.1016/j.geb.2017.06.005 · Cited by 10
Colouring Squares of Claw-free Graphs
de Verclos, R. D. J., Kang, R. J., & Pastor, L. (2019) · HAL · doi:10.4153/cjm-2017-029-9 · Cited by 10
On Counting Perfect Matchings in General Graphs
Štefankovič, D., Vigoda, E., & Wilmes, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-77404-6_63 · Cited by 15
Capelli, R., Sergio Caracciolo, A., Gioacchino, A. D., & Malatesta, E. M. (2018) · Physical review. E · doi:10.1103/physreve.98.030101 · Cited by 10
Maximum matching and the game of Slither
Anderson, W. N. (1974) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(74)90029-x · Cited by 10
Tree search and quantum computation
Tarrataca, L., & Wichert, A. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0212-z · Cited by 15
Polyhedral Methods for the QAP
Kaibel, V. (2000) · Combinatorial optimization · doi:10.1007/978-1-4757-3155-2_6 · Cited by 10
Bensen, J. T., Li, R., Hutchinson, R. G., Province, M. A., & Tyroler, H. A. (1999) · Genetic Epidemiology · doi:10.1002/(sici)1098-2272(1999)16:2 · Cited by 42
A Combinatorial Algorithm to Find a Maximum Even Factor
Pap, G. (2005) · Lecture notes in computer science · doi:10.1007/11496915_6 · Cited by 10
Blocking and Antiblocking Polyhedra
Tind, J. (1979) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70823-9 · Cited by 10
An Augmenting Path Algorithm For The Parity Problem On Linear Matroids
Stallmann, M. F. M., & Gabow, H. N. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715918 · Cited by 10
Batching and Optimal Multi-stage Bipartite AllocationsPreprint
Feng, Y., & Niazadeh, R. (2020) · SSRN Electronic Journal · doi:10.2139/ssrn.3689448 · Cited by 10
Kidney Exchange: An Operations Perspective
Itai Ashlagi, A., & Roth, A. E. (2021) · National Bureau of Economic Research · doi:10.3386/w28500 · Cited by 10
Optimization approach for the core structure of a wind turbine blade
Kuznetsov, I., Kozhin, V. A., Novokshenov, A., Elsken, T., & Nemov, A. S. (2024) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-024-03812-z · Cited by 9
Lattice surgery realized on two distance-three repetition codes with superconducting qubits
Besedin, I. S., Kerschbaum, M., Knoll, J., Hesner, I., Bödeker, L., Colmenárez, L., Hofele, L., Lacroix, N., Hellings, C., Swiadek, F., et al. (2026) · Nature Physics · doi:10.1038/s41567-025-03090-6 · Cited by 9
Improved Belief Propagation Decoding Algorithms for Surface Codes
Chen, J., Yi, Z., Liang, Z., & Wang, X. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3577769 · Cited by 16
Yu, Q., Xiao, Z., Li, B., Wang, Z., Chen, C., & Zhang, W. (2025) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3726302.3730288 · Cited by 29
Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030345 · Cited by 2
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
