The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Efficient algorithms for finding maximum matching in graphs
Open accessAbstract
This paper surveys the techniques used for designing the most efficient algorithms for finding a maximum cardinality or weighted matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements in existing algorithms and the existence of fast parallel algorithms for these problems.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
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
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 2,656
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (1956) · Canadian Journal of Mathematics · doi:10.4153/cjm-1956-045-5 · Cited by 2,410
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_15 · Cited by 1,829
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
Matching is as easy as matrix inversion
Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.383347 · Cited by 609
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., & Valiant, L. G. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90045-x · Cited by 570
Berge, C. (1957) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.43.9.842 · Cited by 567
Tarjan, R. E. (1977) · Networks · doi:10.1002/net.3230070103 · Cited by 365
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Gabow, H. N. (1976) · Journal of the ACM · doi:10.1145/321941.321942 · Cited by 342
On the Asymptotic Complexity of Matrix Multiplication
Coppersmith, D., & Winograd, S. (1982) · SIAM Journal on Computing · doi:10.1137/0211038 · Cited by 209
Computer programming as an art
Knuth, D. E. (2007) · ACM Turing award lectures · doi:10.1145/1283920.1283929 · Cited by 187
The maximum flow problem is log space complete for P
Goldschlager, L. M., Shaw, R. A., & Staples, J. (1982) · Theoretical Computer Science · doi:10.1016/0304-3975(82)90092-5 · Cited by 134
An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
Galil, Z., Micali, S. M., & Gabow, H. N. (1986) · SIAM Journal on Computing · doi:10.1137/0215009 · Cited by 129
Self-citationMaximum matchings in general graphs through randomization
Rabin, M. O., & Vazirani, V. V. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90005-9 · Cited by 125
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
A scaling algorithm for weighted matching on general graphs
Gabow, H. N. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.3 · Cited by 108
A shortest augmenting path method for solving minimal perfect matching problems
Derigs, U. (1981) · Networks · doi:10.1002/net.3230110407 · Cited by 71
Efficient Implementation Of Graph Algorithms Using Contraction
Gabow, H. N., Galil, Z., & Spencer, T. H. (1984) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715935 · Cited by 39
Self-citationSensitivity analysis of optimal matchings
Weber, G. (1981) · Networks · doi:10.1002/net.3230110105 · Cited by 36
A O(|V|·|E|) algorithm for maximum matching of graphs
Kameda, T., & Munro, I. (1974) · Computing · doi:10.1007/bf02239502 · Cited by 35
Cited by
Is the Sample Good Enough? Comparing Data from Twitter's Streaming API with Twitter's Firehose
Morstatter, F., Pfeffer, J., Liu, H., & Carley, K. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v7i1.14401 · Cited by 863
The Amborella Genome and the Evolution of Flowering Plants
Amborella Genome Project, Albert, V. A., Barbazuk, W. B., dePamphilis, C. W., Der, J. P., Leebens-Mack, J., Ma, H., Palmer, J. D., Rounsley, S., Sankoff, D., et al. (2013) · Science · doi:10.1126/science.1241089 · Cited by 856
Quantifying the benefits of vehicle pooling with shareability networks
Santi, P., Resta, G., Szell, M., Sobolevsky, S., Strogatz, S. H., & Ratti, C. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1403657111 · Cited by 745
c-Through: part-time optics in data centers
Wang, G., Andersen, D. G., Kaminsky, M., Papagiannaki, K., Ng, T. S. E., Kozuch, M., & Ryan, M. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851222 · Cited by 653
Mix zones: user privacy in location-aware services
Beresford, A. R., & Stajano, F. (2004) · IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second · doi:10.1109/percomw.2004.1276918 · Cited by 485
Metadata
- Authors
- Galil, Z.
- Venue
- ACM Computing Surveys
- Published
- 1986-03
- Volume
- 18
- Issue
- 1
- Pages
- 23-38
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2080090262
- Cited by
- 461
- References
- 33
- FWCI
- 1.91
- Type
- journal article
- Language
- en
- Open access
- bronze
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.