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 301–400 of 1,001
A Decomposition Theory for Binary Linear Codes
Kashyap, N. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924700 · Cited by 57
Online matching: haste makes waste!
Emek, Y., Kutten, S., & Wattenhofer, R. P. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897557 · Cited by 57
Computational Complexity of Combinatorial and Graph-Theoretic Problems
Karp, R. M. (2011) · Springer eBooks · doi:10.1007/978-3-642-11120-4_3 · Cited by 57
Mask assignment and synthesis of DSA-MP hybrid lithography for sub-7nm contacts/vias
Badr, Y. A., Torres, A., & Gupta, P. (2015) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2744769.2744868 · Cited by 56
Some Algorithmic Problems in Polytope Theory
Kaibel, V., & Pfetsch, M. E. (2003) · Springer eBooks · doi:10.1007/978-3-662-05148-1_2 · Cited by 56
Finding k Disjoint Triangles in an Arbitrary Graph
Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., & Telle, J. A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30559-0_20 · Cited by 56
Mobile Data Gathering with Space-Division Multiple Access in Wireless Sensor Networks
Zhao, M., Ma, M., & Yang, Y. (2008) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2008.185 · Cited by 56
Characterizing the algorithmic complexity of reconfigurable data center architectures
Foerster, K.-T., Ghobadi, M., & Schmid, S. (2018) · ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) · doi:10.1145/3230718.3230722 · Cited by 56
Survey of Reconfigurable Data Center Networks
Foerster, K.-T., & Schmid, S. (2019) · ACM SIGACT News · doi:10.1145/3351452.3351464 · Cited by 56
On the minors of an incidence matrix and its Smith normal form
Grossman, J. W., Kulkarni, A., & Schochetman, I. E. (1995) · Linear Algebra and its Applications · doi:10.1016/0024-3795(93)00173-w · Cited by 56
The lattice dimension of a graph
Eppstein, D. (2004) · European Journal of Combinatorics · doi:10.1016/j.ejc.2004.05.001 · Cited by 56
Error rates and resource overheads of repetition cat qubits
Guillaud, J., & Mirrahimi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.042413 · Cited by 55
Scalable Neural Decoder for Topological Surface Codes
Meinerz, K., Park, C.-Y., & Trebst, S. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.080505 · Cited by 55
Proof of Finite Surface Code Threshold for Matching
Fowler, A. G. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.180502 · Cited by 69
Systems of distant representatives
Fiala, J., Kratochvı́l, J., & Proskurowski, A. (2004) · Discrete Applied Mathematics · doi:10.1016/j.dam.2004.02.018 · Cited by 55
Approximate Query Processing for Data Exploration using Deep Generative Models
Thirumuruganathan, S., Hasan, S., Koudas, N., & Das, G. (2020) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde48307.2020.00117 · Cited by 72
On the Complexity of Approximating k-Dimensional Matching
Hazan, E., Safra, M., & Schwartz, O. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45198-3_8 · Cited by 55
Galil, Z., Micali, S. M., & Gabow, H. N. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.36 · Cited by 55
Baldwin, C. H., Mayer, K., Brown, N. C., Ryan-Anderson, C., & Hayes, D. (2022) · Quantum · doi:10.22331/q-2022-05-09-707 · Cited by 54
On the algorithmic complexity of twelve covering and independence parameters of graphs
Manlove, D. F. (1999) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(98)00147-4 · Cited by 54
A Ground-Based Near Infrared Camera Array System for UAV Auto-Landing in GPS-Denied Environment
Yang, T., Li, G., Li, J., Zhang, Y., Zhang, X., Zhang, Z., & Li, Z. (2016) · Sensors · doi:10.3390/s16091393 · Cited by 54
Huang, X. S., Sun, X. S., & Ng, T. S. E. (2016) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/2999572.2999592 · Cited by 54
A good algorithm for lexicographically optimal flows in multi-terminal networks
Megiddo, N. (1977) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1977-14298-5 · Cited by 54
Incremental assignment problem
Toroslu, İ. H., & Üçoluk, G. (2006) · Information Sciences · doi:10.1016/j.ins.2006.05.004 · Cited by 54
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Elf, M., Gutwenger, C., Jünger, M., & Rinaldi, G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45586-8_5 · Cited by 53
Routing-aware fair contact plan design for predictable delay tolerant networks
Fraire, J. A., & Finochietto, J. M. (2014) · Ad Hoc Networks · doi:10.1016/j.adhoc.2014.07.006 · Cited by 53
Distributed Approximate Matching
Lotker, Z., Boaz Patt-shamir, B., & Rosén, A. (2009) · SIAM Journal on Computing · doi:10.1137/080714403 · Cited by 53
Simulation of rare events in quantum error correction
Bravyi, S. B., & Vargo, A. (2013) · Physical Review A · doi:10.1103/physreva.88.062308 · Cited by 68
Complexity of Combinatorial Algorithms
Tarjan, R. E. (1978) · SIAM Review · doi:10.1137/1020067 · Cited by 54
Rethinking the physical layer of data center networks of the next decade
Wang, H., Xia, Y., Bergman, K., Ng, T. S. E., Sahu, S., & Sripanidkulchai, K. (2013) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2500098.2500105 · Cited by 52
Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information
Anshelevich, E., & Sekar, S. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10032 · Cited by 52
Polyhedral Approaches to Mixed Integer Linear Programming
Conforti, M., Cornuéjols, G., & Zambelli, G. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_11 · Cited by 53
Graph Theory as I Have Known It
Ball, J., & Welsh, D. J. A. (1998) · doi:10.1093/oso/9780198502517.001.0001 · Cited by 52
Single‐Strip Triangulation of Manifolds with Arbitrary Topology
Gopi, M., & Eppstien, D. (2004) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2004.00768.x · Cited by 52
Kitaev's Zd -code threshold estimates
Duclos-Cianci, G., & Poulin, D. (2013) · Physical Review A · doi:10.1103/physreva.87.062338 · Cited by 51
The perfectly Matchable Subgraph Polytope of an arbitrary graph
Balas, E., & Pulleyblank, W. R. (1989) · COMBINATORICA · doi:10.1007/bf02125345 · Cited by 51
Efficient decoding of topological color codes
Sarvepalli, P. K., & Raussendorf, R. (2012) · Physical Review A · doi:10.1103/physreva.85.022317 · Cited by 51
Scaling Algorithms for Weighted Matching in General Graphs
Duan, R., Pettie, S., & Su, H.-H. (2018) · ACM Transactions on Algorithms · doi:10.1145/3155301 · Cited by 51
A survey on approximation in parameterized complexity: hardness and algorithms
Feldmann, A. E., Karthik, C. S., Lee, E., & Manurangsi, P. (2020) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 51
Scaling and logic in the colour code on a superconducting quantum processor
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., et al. (2025) · Nature · doi:10.1038/s41586-025-09061-4 · Cited by 51
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
David Coudert, A., Ducoffe, G., & Popa, A. (2019) · ACM Transactions on Algorithms · doi:10.1145/3310228 · Cited by 50
Approximating Maximum Edge Coloring in Multigraphs
Feige, U., Ofek, E. O., & Wieder, U. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45753-4_11 · Cited by 50
On the classification of NP-complete problems in terms of their correlation coefficient
Angel, É., & Zissimopoulos, V. (2000) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00138-9 · Cited by 50
On linear characterizations of combinatorial optimization problems
Karp, R. M., & Papadimitriou, C. H. (1980) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1980.29 · Cited by 50
Towards practical classical processing for the surface code: Timing analysis
Fowler, A. G., Whiteside, A. C., & Hollenberg, L. C. L. (2012) · Physical Review A · doi:10.1103/physreva.86.042313 · Cited by 49
Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
Higgott, O., & Breuckmann, N. P. (2021) · Physical Review X · doi:10.1103/physrevx.11.031039 · Cited by 48
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Cerioli, M. R., Faria, L., Ferreira, T. O., Martinhon, C. A. D. J., Protti, F., & Reed, B. A. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.10.015 · Cited by 49
Path problems in skew-symmetric graphs
Goldberg, A. V., & Karzanov, A. V. (1996) · COMBINATORICA · doi:10.1007/bf01261321 · Cited by 48
Maximum matchings in planar graphs via gaussian elimination
Mucha, M., & Sankowski, P. (2006) · Algorithmica · doi:10.1007/s00453-005-1187-5 · Cited by 53
Undecidability and hardness in mixed-integer nonlinear programming
Liberti, L. (2018) · RAIRO - Operations Research · doi:10.1051/ro/2018036 · Cited by 53
Total Dual Integrality of Linear Inequality Systems
Edmonds, J., & Giles, R. (1984) · Elsevier eBooks · doi:10.1016/b978-0-12-566780-7.50013-1 · Cited by 48
Self-citationASPECTS OF STRUCTURAL COMBINATORICS (Graph Homomorphisms and Their Use)
Nešetřil, J. (1999) · Taiwanese Journal of Mathematics · doi:10.11650/twjm/1500407157 · Cited by 48
Exploiting degeneracy in belief propagation decoding of quantum codes
Kuo, K.-Y., & Lai, C. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00623-2 · Cited by 46
Radius of convergence in lattice QCD at finite μ B with rooted staggered fermions
Giordano, M., Kapás, K., Katz, S. D., Nógrádi, D., & Pásztor, A. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.074511 · Cited by 47
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
Fomin, F. V., Lokshtanov, D., Saurabh, S., Pilipczuk, M., & Wrochna, M. (2018) · ACM Transactions on Algorithms · doi:10.1145/3186898 · Cited by 47
Individual Rationality and Participation in Large Scale, Multi-Hospital Kidney Exchange
Itai Ashlagi, A., & Roth, A. E. (2011) · National Bureau of Economic Research · doi:10.3386/w16720 · Cited by 47
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
Baswana, S., Gupta, M., & Sen, S. (2015) · SIAM Journal on Computing · doi:10.1137/130914140 · Cited by 46
Independent Sets of Maximum Weight in Apple-Free Graphs
Brandstädt, A., Lozin, V., & Mosca, R. (2010) · SIAM Journal on Discrete Mathematics · doi:10.1137/090750822 · Cited by 46
Possible and Necessary Winners of Partial Tournaments
Aziz, H., Brill, M., Fischer, F., Harrenstein, P., Lang, J., & Seedig, H. G. (2015) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4856 · Cited by 46
Chiang, Y.-T., Lu, C.-H., & Hsu, J. Y.-J. (2017) · IEEE Transactions on Human-Machine Systems · doi:10.1109/thms.2016.2641679 · Cited by 46
Multi-path Summation for Decoding 2D Topological Codes
Criger, B., & Ashraf, I. (2018) · Quantum · doi:10.22331/q-2018-10-19-102 · Cited by 55
On the Complexity of Set Packing Polyhedra
Padberg, M. W. (1977) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70750-7 · Cited by 46
The optimal path-matching problem
Cunningham, W. H., & Geelen, J. F. (1997) · COMBINATORICA · doi:10.1007/bf01215915 · Cited by 46
Boisvert, R. F., Donahue, M. J., Lozier, D. W., McMichael, R. D., & Rust, B. W. (2001) · Journal of Research of the National Institute of Standards and Technology · doi:10.6028/jres.106.011 · Cited by 45
Degree-preserving network growth
Kharel, S. R., Mezei, T. R., Chung, S., Erdős, P. L., & Toroczkai, Z. (2021) · Nature Physics · doi:10.1038/s41567-021-01417-7 · Cited by 45
Edge-disjoint in- and out-branchings in tournaments and related path problems
Bang‐Jensen, J. (1991) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(91)90002-2 · Cited by 45
Ye, Y., & Borodin, A. (2012) · ACM Transactions on Algorithms · doi:10.1145/2151171.2151177 · Cited by 45
On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
Fraire, J. A., Madoery, P. G., & Finochietto, J. M. (2014) · IEEE Sensors Journal · doi:10.1109/jsen.2014.2348917 · Cited by 45
Krajı́ček, J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108242066 · Cited by 66
The Online Matching Problem on a Line
Koutsoupias, E., & Nanavati, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24592-6_14 · Cited by 45
A renormalization group decoding algorithm for topological quantum codes
Duclos-Cianci, G., & Poulin, D. (2010) · IEEE Information Theory Workshop (ITW) · doi:10.1109/cig.2010.5592866 · Cited by 45
Unique Maximum Matching Algorithms
Gabow, H. N., Kaplan, H. Y., & Tarjan, R. E. (2001) · Journal of Algorithms · doi:10.1006/jagm.2001.1167 · Cited by 45
Nguyen, M. T., & Le, L. B. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3188867 · Cited by 44
Single-shot quantum error correction with the three-dimensional subsystem toric code
Kubica, A., & Vasmer, M. (2022) · Nature Communications · doi:10.1038/s41467-022-33923-4 · Cited by 49
Bias-tailored quantum LDPC codes
Roffe, J., Cohen, L. Z., Quintavalle, A. O., Chandra, D., & Campbell, E. T. (2023) · Quantum · doi:10.22331/q-2023-05-15-1005 · Cited by 53
ScaffMatch: scaffolding algorithm based on maximum weight matching
Mandric, I., & Zelikovsky, A. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv211 · Cited by 44
Anderson, R., Itai Ashlagi, A., Gamarnik, D., Rees, M. A., Roth, A. E., Sönmez, T., & Ünver, M. U. (2015) · INFORMS Journal on Applied Analytics · doi:10.1287/inte.2014.0766 · Cited by 44
New perspectives on segmented crystal calorimeters for future colliders
Lucchini, M. T., Chung, W., Eno, S. C., Lai, Y., Lucchini, L., Nguyen, M., & Tully, C. G. (2020) · Journal of Instrumentation · doi:10.1088/1748-0221/15/11/p11005 · Cited by 44
Distribution of entanglement in large-scale quantum networks
Perseguers, S., Lapeyre Jr., G., Cavalcanti, D., Lewenstein, M., & Acín, A. (2013) · MPG.PuRe (Max Planck Society) · Cited by 58
Finding nucleolus of flow game
Deng, X., Fang, Q., & Sun, X. (2008) · Journal of Combinatorial Optimization · doi:10.1007/s10878-008-9138-0 · Cited by 44
Vidick, T., & Watrous, J. (2016) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000068 · Cited by 44
Ancient eudicot hexaploidy meets ancestral eurosid gene order
Zheng, C., Chen, E. C., Albert, V. A., Lyons, E. H., & Sankoff, D. (2013) · BMC Genomics · doi:10.1186/1471-2164-14-s7-s3 · Cited by 44
A kernel of order 2k−c for Vertex Cover
Soleimanfallah, A., & Yeo, A. (2011) · Discrete Mathematics · doi:10.1016/j.disc.2011.02.014 · Cited by 43
Gerards, A. M. H. (1995) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(05)80120-3 · Cited by 45
A travelling salesman approach to solve the F/no-idle/Cmax problem
Saadani, N. E. H., Guinet, A., & Moalla, M. (2004) · European Journal of Operational Research · doi:10.1016/j.ejor.2003.08.030 · Cited by 43
The roommates problem revisited
Morrill, T. (2010) · Journal of Economic Theory · doi:10.1016/j.jet.2010.02.003 · Cited by 43
Random assignment under weak preferences
Yılmaz, Ö. (2008) · Games and Economic Behavior · doi:10.1016/j.geb.2008.04.017 · Cited by 43
Colouring graphs when the number of colours is almost the maximum degree
Molloy, M. S. O., & Reed, B. A. (2014) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2014.06.004 · Cited by 42
Strategies for extending geminal-based wavefunctions: Open shells and beyond
Johnson, P. A., Limacher, P. A., Kim, T. D., Richer, M., Miranda‐Quintana, R. A., Heidar‐Zadeh, F., Ayers, P. W., Bultinck, P., Baerdemacker, S. D., & Neck, D. V. (2017) · Computational and Theoretical Chemistry · doi:10.1016/j.comptc.2017.05.010 · Cited by 45
How URLLC Can Benefit From NOMA-Based Retransmissions
Kotaba, R., Manchón, C. N., Balercia, T., & Popovski, P. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3035517 · Cited by 42
The Stable Roommates Problem with Globally Ranked Pairs
Abraham, D. J., Levavi, A., Manlove, D. F., & O’Malley, G. (2008) · Internet Mathematics · doi:10.1080/15427951.2008.10129167 · Cited by 42
Fractional matchings and the Edmonds-Gallai theorem
Pulleyblank, W. R. (1987) · Discrete Applied Mathematics · doi:10.1016/0166-218x(87)90053-9 · Cited by 42
Establishing the matching polytope
Balinski, M. (1972) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(72)90002-0 · Cited by 42
Akahoshi, Y., Maruyama, K., Oshima, H., Sato, S., & Fujii, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010337 · Cited by 63
Tractability in constraint satisfaction problems: a survey
Carbonnel, C., & Cooper, M. C. (2015) · Constraints · doi:10.1007/s10601-015-9198-6 · Cited by 46
Thermalization, Error Correction, and Memory Lifetime for Ising Anyon Systems
Brell, C. G., Burton, S., Dauphinais, G., Flammia, S. T., & Poulin, D. (2014) · Physical Review X · doi:10.1103/physrevx.4.031058 · Cited by 49
Vatavu, R.-D., Anthony, L., & Wobbrock, J. O. (2018) · International Conference on Human-Computer Interaction with Mobile Devices and Services (MobileHCI) · doi:10.1145/3229434.3229465 · Cited by 41
Decoding surface code with a distributed neural network–based decoder
Varsamopoulos, S., Bertels, K., & Almudéver, C. G. (2020) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00015-9 · Cited by 41
Enhanced noise resilience of the surface–Gottesman-Kitaev-Preskill code via designed bias
Hänggli, L., Heinze, M., & König, R. (2020) · Physical Review A · doi:10.1103/physreva.102.052408 · Cited by 37
The optimal chain length for kidney paired exchanges: an analysis of the Dutch program
de Klerk, M., van der Deijl, W., Witvliet, M. D., Haase-Kromwijk, B. J. J. M., Claas, F. H. J., & Weimar, W. W. (2010) · Transplant International · doi:10.1111/j.1432-2277.2010.01114.x · Cited by 41
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
