Paths, Trees, and Flowers

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

TWO THEOREMS IN GRAPH THEORY

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

Error-correction and noise-decoherence thresholds for coherent errors in planar-graph surface codes

Venn, F., & Béri, B. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043412 · Cited by 15

Resource Allocation and Hybrid OMA/NOMA Mode Selection for Non-Coherent Joint Transmission

Shao, H., Zhang, H., Sun, L., & Qian, Y. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3115112 · Cited by 14

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems

Hanaka, T., Kiyomi, M., Kobayashi, Y., Kobayashi, Y., Kurita, K., & Otachi, Y. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i4.25511 · Cited by 14

Fault-tolerant quantum architectures based on erasure qubits

Gu, S., Retzker, A., & Kubica, A. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013249 · Cited by 24

Error Correction of Transversal cnot Gates for Scalable Surface-Code Computation

Sahay, K., Lin, Y., Huang, S., Brown, K. R., & Puri, S. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020326 · Cited by 16

Quantum Error Correction resilient against Atom Loss

Perrin, H., Jandura, S., & Pupillo, G. (2025) · Quantum · doi:10.22331/q-2025-10-13-1884 · Cited by 14

The Excessive [3]-Index of All Graphs

Cariolaro, D., & Fu, H. (2009) · The Electronic Journal of Combinatorics · doi:10.37236/213 · Cited by 14

Efficient recognition of equimatchable graphs

Demange, M., & Ekim, T. (2013) · Information Processing Letters · doi:10.1016/j.ipl.2013.08.002 · Cited by 14

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

Hougardy, S. (2008) · Springer eBooks · doi:10.1007/978-3-540-76796-1_9 · Cited by 15

Measurement-free implementations of small-scale surface codes for quantum-dot qubits

Ercan, H., Ghosh, J., Crow, D., Premakumar, V. N., Joynt, R., Friesen, M. G., & Coppersmith, S. N. (2018) · Physical Review A · doi:10.1103/physreva.97.012318 · Cited by 14

Tropical matchings in vertex-colored graphs

Cohen, J., Manoussakis, Y., Pham, H. P., & Tuza, Z. (2017) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2017.10.038 · Cited by 14

Correcting Spanning Errors With a Fractal Code

Nixon, G. M., & Brown, B. J. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3068359 · Cited by 14

Quantum error correction with fractal topological codes

Dua, A., Jochym-O’Connor, T., & Zhu, G. (2023) · Quantum · doi:10.22331/q-2023-09-26-1122 · Cited by 14

Radical Anti-Realism and Substructural Logics

Dubucs, J., & Marion, M. (2003) · Springer eBooks · doi:10.1007/978-94-017-2612-2_17 · Cited by 14

Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover

Alon, N., & Yuster, R. (2007) · Springer eBooks · doi:10.1007/978-3-540-75520-3_17 · Cited by 13

Polyhedron of triangle-free simple 2-matchings in subcubic graphs

Hartvigsen, D., & Li, Y. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0516-0 · Cited by 14

3-Colouring AT-Free Graphs in Polynomial Time

Stacho, J. (2012) · Algorithmica · doi:10.1007/s00453-012-9624-8 · Cited by 14

Quantifying energetics of topological frustration in carbon nanostructures

Bullard, Z., Girão, E. C., Daniels, C., Sumpter, B. G., & Meunier, V. (2014) · Physical Review B · doi:10.1103/physrevb.89.245425 · Cited by 14

Minimum Cost Resource Allocation for Meeting Job Requirements

Chakaravarthy, V. T., Parija, G. R., Roy, S., Sabharwal, Y., & Kumar, A. (2011) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2011.12 · Cited by 14

Induced Matchings in Graphs of Bounded Maximum Degree

Joos, F. (2016) · SIAM Journal on Discrete Mathematics · doi:10.1137/16m1058078 · Cited by 14

Erdős–Ko–Rado for perfect matchings

Lindzey, N. (2017) · European Journal of Combinatorics · doi:10.1016/j.ejc.2017.05.005 · Cited by 14

OMCO: Online Multiple Coflow Scheduling in Optical Circuit Switch

Xu, C., Tan, H., Hou, J., Zhang, C., & Li, X. (2018) · International Conference on Communications · doi:10.1109/icc.2018.8422565 · Cited by 14

Effective *-flow schedule for optical circuit switching based data center networks: A comprehensive survey

Tang, Y., Yuan, T., Liu, B., & Xiao, C. (2021) · Computer Networks · doi:10.1016/j.comnet.2021.108321 · Cited by 14

Test Planning in Digital Microfluidic Biochips Using Efficient Eulerization Techniques

Mitra, D., Ghoshal, S., Rahaman, H., Chakrabarty, K., & Bhattacharya, B. B. (2011) · Journal of Electronic Testing · doi:10.1007/s10836-011-5239-2 · Cited by 14

Solving a "Hard" problem to approximate an "Easy" one

Fekete, S. P., Meijer, H., Rohe, A., & Tietze, W. (2002) · ACM Journal of Experimental Algorithmics · doi:10.1145/944618.944629 · Cited by 14

Two Approximation Algorithms for 3-Cycle Covers

Bläser, M., & Manthey, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45753-4_6 · Cited by 14

On Sets with Efficient Implicit Membership Tests

Hemaspaandra, L. A., & Hoene, A. (1991) · SIAM Journal on Computing · doi:10.1137/0220071 · Cited by 14

A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective

Derigs, U. (1979) · Discrete Applied Mathematics · doi:10.1016/0166-218x(79)90041-6 · Cited by 14

Sur le problème du couplage maximal

Uhry, J. P. (1975) · Revue française d automatique informatique recherche opérationnelle Recherche opérationnelle · doi:10.1051/ro/197509v300131 · Cited by 14

Lifetime of topological quantum memories in thermal environmentPreprint

Al-Shimary, A., Wootton, J. R., & Pachos, J. K. (2016) · Cited by 14

Advancing solar and wind penetration in China through energy complementarity

Hu, Y., Jiang, H., Zhang, C., Yuan, J., Zhang, M., Yao, L., Chen, Q., Wu, J., Zhang, H., Ma, S., et al. (2026) · Nature · doi:10.1038/s41586-026-10570-z · Cited by 13

A Framework for Designing Multihop Energy Harvesting Sensor Networks

Sunny, A., & Joy Kuri, B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2551486 · Cited by 13

Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture

Larsen, M. V., Chamberland, C., Noh, K., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) · Cited by 13

ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing

Vittal, S., Das, P., & Qureshi, M. K. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614251 · Cited by 14

Topological error correcting processes from fixed-point path integrals

Bauer, A. (2024) · Quantum · doi:10.22331/q-2024-03-20-1288 · Cited by 13

Introducing Ambiguity Clustering: An Accurate and Efficient Decoder for qLDPC Codes

Wolanski, S., & Barber, B. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10326 · Cited by 19

Improving FPGA repair under real-time constraints

Nazar, G. L. (2015) · Microelectronics Reliability · doi:10.1016/j.microrel.2015.04.003 · Cited by 13

Enhancing Downlink Performance in Wireless Networks by Simultaneous Multiple Packet Transmission

Zhang, Z., Yang, Y., & Zhao, M. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2008.191 · Cited by 13

The Maximum Independent Set Problem and Augmenting Graphs

Hertz, A., & Lozin, V. (2005) · Springer eBooks · doi:10.1007/0-387-25592-3_4 · Cited by 13

Extension Complexity of Stable Set Polytopes of Bipartite Graphs

Aprile, M., Faenza, Y., Fiorini, S., Huynh, T., & Macchia, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-68705-6_6 · Cited by 13

Deterministic Min-Cost Matching with Delays

Azar, Y., & Fanani, A. J. (2020) · Theory of Computing Systems · doi:10.1007/s00224-019-09963-7 · Cited by 13

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness

Dörfler, J., Roth, M., Schmitt, J., & Wellnitz, P. (2021) · Algorithmica · doi:10.1007/s00453-021-00894-9 · Cited by 26

Detection Strategy Against Restricted SSDF Attack With Potential Interaction Assistance

Cheng, Z., Zhang, J., Song, T., Hu, J., & Bao, X. (2020) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2020.3016053 · Cited by 13

Verified Textbook Algorithms

Nipkow, T., Eberl, M., & Haslbeck, M. P. L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-59152-6_2 · Cited by 13

Quantum-accelerated constraint programming

Booth, K. E. C., O’Gorman, B., Marshall, J., Hadfield, S., & Rieffel, E. G. (2021) · Quantum · doi:10.22331/q-2021-09-28-550 · Cited by 13

Scrubbing unit repositioning for fast error repair in FPGAs

Nazar, G. L., Santos, L. P., & Carro, L. (2013) · International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES) · doi:10.1109/cases.2013.6662506 · Cited by 13

Practical and scalable decoder for topological quantum error correction with an Ising machine

Fujisaki, J., Oshima, H., Sato, S., & Fujii, K. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043086 · Cited by 13

Disconnected matchings

Gomes, G. C. M., Masquio, B. P., Pinto, P. E. D., dos Santos, V. F., & SZWARCFITER, J. L. (2023) · Theoretical Computer Science · doi:10.1016/j.tcs.2023.113821 · Cited by 13

Novel Union-Find-based Decoders for Scalable Quantum Error Correction on Systolic Arrays

Heer, M. J., Sozzo, E. D., Fujii, K., & Sano, K. (2023) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw59300.2023.00092 · Cited by 13

A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings

Kita, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35261-4_12 · Cited by 13

Good characterizations for some degree constrained subgraphs

Szabó, J. (2008) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2008.08.009 · Cited by 13

Greedy Matching: Guarantees and Limitations

Besser, B., & Poloczek, M. (2015) · Algorithmica · doi:10.1007/s00453-015-0062-2 · Cited by 13

Testing of Digital Microfluidic Biochips Using Improved Eulerization Techniques and the Chinese Postman Problem

Mitra, D., Ghoshal, S., Rahaman, H., Chakrabarty, K., & Bhattacharya, B. B. (2010) · Proceedings - Asian Test Symposium/Proceedings · doi:10.1109/ats.2010.28 · Cited by 13

Maximizing the strong triadic closure in split graphs and proper interval graphs

Konstantinidis, A. L., & Papadopoulos, C. (2020) · Discrete Applied Mathematics · doi:10.1016/j.dam.2020.05.035 · Cited by 13

Lee–Yang Theorems and the Complexity of Computing Averages

Sinclair, A., & Srivastava, P. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2036-7 · Cited by 14

Random Euclidean matching problems in one dimension

Sergio Caracciolo, A., d'Achille, M., & Sicuro, G. (2017) · Physical review. E · doi:10.1103/physreve.96.042102 · Cited by 13

Design methods for 3D wireframe DNA nanostructures

Orponen, P. (2017) · Natural Computing · doi:10.1007/s11047-017-9647-9 · Cited by 13

Elimination Graphs

Ye, Y., & Borodin, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02927-1_64 · Cited by 13

Exploring Frequented Regions in Pan-Genomic Graphs

Cleary, A., Ramaraj, T., Kahanda, I., Mudge, J., & Mumey, B. (2018) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2018.2864564 · Cited by 14

A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model

Paz, A., & Schwartzman, G. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.140 · Cited by 13

Efficient Algorithms for Maximum Weight Matchings in General Graphs with Small Edge Weights

Huang, C.-C., & Kavitha, T. (2012) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973099.110 · Cited by 14

Dulmage-Mendelsohn Percolation: Geometry of Maximally Packed Dimer Models and Topologically Protected Zero Modes on Site-Diluted Bipartite Lattices

Anonymous, Biswas, S., Islam, M. M., & Damle, K. (2022) · Physical Review X · doi:10.1103/physrevx.12.021058 · Cited by 13

Zero-Visibility Cops and Robber Game on a Graph

Dereniowski, D., Dyer, D., Tifenbach, R. M., & Yang, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38756-2_19 · Cited by 13

Contributions to the Design of Residue Number System Architectures

Gerard, B., Kammerer, J.-G., & Merkiche, N. (2015) · IEEE Symposium on Computer Arithmetic (ARITH) · doi:10.1109/arith.2015.25 · Cited by 13

Graph-Theoretical Methods in Computer Vision

Shokoufandeh, A., & Dickinson, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45878-6_5 · Cited by 13

Maximum skew-symmetric flows

Goldberg, A. V., & Karzanov, A. V. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60313-1_141 · Cited by 13

The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree

Szymańska, E. (2012) · European Journal of Combinatorics · doi:10.1016/j.ejc.2011.12.009 · Cited by 13

Accurate simulations of planar topological codes cannot use cyclic boundaries

Fowler, A. G. (2013) · Physical Review A · doi:10.1103/physreva.87.062320 · Cited by 13

Counting the Number of Perfect Matchings in K5-Free Graphs

Straub, S., Thierauf, T., & Wagner, F. (2014) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2014.15 · Cited by 14

Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus

Gerards, A. M. H. (1991) · Operations Research Letters · doi:10.1016/0167-6377(91)90038-q · Cited by 13

Examples and algorithmic properties of greedoids

Goecke, O., Körte, B., & Lovász, L. (1989) · Lecture notes in mathematics · doi:10.1007/bfb0083463 · Cited by 13

An efficient algorithm for minimumk-covers in weighted graphs

White, L. J., & Gillenson, M. L. (1975) · Mathematical Programming · doi:10.1007/bf01580426 · Cited by 13

A structure theorem for maximum internal matchings in graphs

Bartha, M., & Gombás, É. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90196-o · Cited by 13

The maximum independent set problem for cubic planar graphs

Burns, J. E. (1989) · Networks · doi:10.1002/net.3230190307 · Cited by 13

Algebra and Discrete Mathematics

(2007) · Springer eBooks · doi:10.1007/978-3-540-72122-2_5 · Cited by 13

POLYNOMIAL TIME ALGORITHMS FOR SOLVING NP-COMPLETE PROBLEMS

Синчев, Б. К., sinchev@mail.ru, Sinchev, A. B., National Information Technology JSC, N.-S., Akzhanova, Z., Issekeshev, Y., & Mukhanova, A. (2020) · NEWS of National Academy of Sciences of the Republic of Kazakhstan · doi:10.32014/2020.2518-170x.59 · Cited by 12

Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond

Fischer, M., Mitrović, S., & Uitto, J. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3520039 · Cited by 12

Sub-6 GHz V2X-Assisted Synchronous Millimeter Wave Scheduler for Vehicle-to-Vehicle Communications

He, C., Wan, Y., Zhao, L., Lu, H., & Shimizu, T. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3191423 · Cited by 12

Finding strong components using depth-first search

Tarjan, R. E., & Zwick, U. (2023) · European Journal of Combinatorics · doi:10.1016/j.ejc.2023.103815 · Cited by 12

Designing Sparse Graphs for Stochastic Matching with an Application to Middle-Mile Transportation Management

Feng, Y., Caldentey, R. A., Xin, L., Zhong, Y., Wang, B., & Hu, H. (2024) · Management Science · doi:10.1287/mnsc.2022.01588 · Cited by 12

Facilitating practical fault-tolerant quantum computing based on color codes

Zhang, J., Wu, Y.-C., & Guo, G.-P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033086 · Cited by 12

Optimal Matching Forests and Valuated Delta-Matroids

Takazawa, K. (2014) · SIAM Journal on Discrete Mathematics · doi:10.1137/110827661 · Cited by 12

Popular Matchings with Ties and Matroid Constraints

Kamiyama, N. (2017) · SIAM Journal on Discrete Mathematics · doi:10.1137/15m104918x · Cited by 12

A lower bound on the acyclic matching number of subcubic graphs

Fürst, M., & Rautenbach, D. (2018) · Discrete Mathematics · doi:10.1016/j.disc.2018.05.010 · Cited by 12

A comparison of matching algorithms for kidney exchange programs addressing waiting time

Monteiro, T., Klimentova, X., Pedroso, J. P., & Viana, A. (2020) · Central European Journal of Operations Research · doi:10.1007/s10100-020-00680-y · Cited by 12

An optimized strategy for inter-satellite links assignments in GNSS

Xu, B., Han, K., Ren, Q., Gong, W., Shao, F., Wang, Y., & Chang, J. (2022) · Advances in Space Research · doi:10.1016/j.asr.2022.08.082 · Cited by 12

Improving ranking quality and fairness in Swiss-system chess tournaments

Sauer, P., Cseh, Á., & Lenzner, P. (2024) · Journal of Quantitative Analysis in Sports · doi:10.1515/jqas-2022-0090 · Cited by 12

Per-spectral characterizations of graphs with extremal per-nullity

Wu, T., & Zhang, H. (2015) · Linear Algebra and its Applications · doi:10.1016/j.laa.2015.06.018 · Cited by 12

Complexity and Approximation of Satisfactory Partition Problems

Bazgan, C., Tuza, Ź., & Vanderpooten, D. (2005) · Lecture notes in computer science · doi:10.1007/11533719_84 · Cited by 12

A new upper bound for (n, 3)-MAX-SAT

Bliznets, I. (2012) · Journal of Mathematical Sciences · doi:10.1007/s10958-012-1101-z · Cited by 12

A Depth-first Algorithm to Reduce Graphs in Linear Time

Bartha, M., & Krész, M. (2009) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc.2009.48 · Cited by 12

Cycles in complementary prisms

Meierling, D., Protti, F., Rautenbach, D., & de Almeida, A. R. (2015) · Discrete Applied Mathematics · doi:10.1016/j.dam.2015.04.016 · Cited by 12

Cooperative games with overlapping coalitions: Charting the tractability frontier

Zick, Y., Chalkiadakis, G., Elkind, E., & Markakis, E. (2019) · Artificial Intelligence · doi:10.1016/j.artint.2018.11.006 · Cited by 12

Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs

Wøhlk, S., & Gilbert Laporte, A. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.06.006 · Cited by 12

Contact Plan Design for Navigation Satellite Network Based on Maximum Matching

Hou, Z., Yi, X., Zhao, Y., Li, C., & Xie, Y. (2018) · International Conference on Vision, Image and Signal Processing (ICVISP) · doi:10.1145/3271553.3271576 · Cited by 12

Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling

Wang, C., & JONCKHEERE, E. A. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2117-1 · Cited by 14

Computing in Combinatorial Optimization

Cook, W. J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-319-91908-9_3 · Cited by 14

Reco: Efficient Regularization-Based Coflow Scheduling in Optical Circuit Switches

Zhang, C., Tan, H., Xu, C., Li, X., Tang, S., & Li, Y. (2019) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2019.00020 · Cited by 12

On the (parameterized) complexity of recognizing well-covered (r,ℓ)-graph

Alves, S. R., Dabrowski, K. K., Faria, L., Klein, S., Sau, I., & Souza, U. S. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.06.024 · Cited by 12

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs

Deng, Y. S., Jia, H., Ahmed, S., Lee, J., & Shen, S. (2020) · INFORMS journal on computing · doi:10.1287/ijoc.2020.0970 · Cited by 12

Matchings in Arbitrary Graphs

Brualdi, R. A. (1971) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100046831 · Cited by 9

Using Blossoms to Find Maximum Matchings on Graphs ; CU-CS-056-74

Gabow, H. N. (1974) · CU Scholar (University of Colorado Boulder)

Maximum Matching

Mucha, M. (2008) · Encyclopedia of Algorithms · doi:10.1007/978-0-387-30162-4_225 · Cited by 1

J.-S. Sereni Matchings in Graphs 11/2009

(2015)

Algebraic Algorithms for Matching

Ivan, I., Virza, M., & Yuen, H. (2011)