Keyword

maximum matching

Description: A largest possible set of edges in a graph such that no two selected edges share a vertex, studied in graph theory.

Primary topic: Complexity and Algorithms in Graphs (40%)

Wikidata ID: wiki/Q65088751

OpenAlex ID: keywords/maximum-matching

The Hungarian method for the assignment problem

1955 · H. W. Kuhn · Naval Research Logistics Quarterly · 13,085

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

1973 · John E. Hopcroft, Richard M. Karp · SIAM Journal on Computing · 2,801

Paths, Trees, and Flowers

1965 · Jack Edmonds · Canadian Journal of Mathematics · 2,428

PDF

Maximum matching and a polyhedron with 0,1-vertices

1965 · Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1,712

PDF

Partitioning Sparse Matrices with Eigenvectors of Graphs

1990 · Alex Pothen, Horst D. Simon, et al. · SIAM Journal on Matrix Analysis and Applications · 1,684

An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

1980 · Silvio Micali, Vijay V. Vazirani · Annual Symposium on Foundations of Computer Science · 823

An optimal algorithm for on-line bipartite matching

1990 · R. M. Karp, U. V. Vazirani, et al. · ACM Symposium on Theory of Computing (STOC) · 719

PDF

Matching is as easy as matrix inversion

1987 · Ketan Mulmuley, Umesh V. Vazirani, et al. · 612

PDF

Algorithms for Loop Matchings

1978 · Ruth Nussinov, George Pieczenik, et al. · SIAM Journal on Applied Mathematics · 586

A linear-time algorithm for a special case of disjoint set union

1985 · Harold N. Gabow, Robert Endre Tarjan · Journal of Computer and System Sciences · 552

Efficient algorithms for finding maximum matching in graphs

1986 · Zvi Galil · ACM Computing Surveys · 461

PDF

A framework for community identification in dynamic social networks

2007 · Chayant Tantipathananandh, Tanya Berger-Wolf, et al. · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · 448

An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems

1984 · Dahbura, Masson · IEEE Transactions on Computers · 432

Matching is as easy as matrix inversion

1987 · Ketan Mulmuley, Umesh V. Vazirani, et al. · COMBINATORICA · 388

Computing the block triangular form of a sparse matrix

1990 · Alex Pothen, Chin-Ju Fan · ACM Transactions on Mathematical Software · 385

PDF

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

1976 · Harold N. Gabow · Journal of the ACM · 342

PDF

A Survey of Parallel Algorithms for Shared-Memory Machines

1988 · Richard M. Karp · UC Berkeley · 320

Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity

2010 · Neumann, Frank, Witt, Carsten · 319

An O (N2.5) algorithm for maximum matching in general graphs

1975 · S. Even, O. Kariv · Annual Symposium on Foundations of Computer Science · 287

Linear-time computability of combinatorial problems on series-parallel graphs

1982 · K. Takamizawa, T. Nishizeki, et al. · Journal of the ACM · 283

PDF

Matching Theory (North-Holland mathematics studies)

1986 · László Lovász · Elsevier eBooks · 276

Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile

1980 · Najiba Sbihi · Discrete Mathematics · 276

Maximum Matchings via Gaussian Elimination

2004 · M. Mucha, P. Sankowski · Annual Symposium on Foundations of Computer Science · 272

Linear-Time Approximation for Maximum Weight Matching

2014 · Ran Duan, Seth Pettie · Journal of the ACM · 265

Constructing a perfect matching is in random NC

1986 · R. M. Karp, E. Upfal, et al. · COMBINATORICA · 264

Works count: 2,654

Citation count: 54,400