# maximum matching

Also found in: Dictionary, Thesaurus, Medical, Legal, Financial.

## maximum matching

[¦mak·sə·məm ′mach·iŋ]
(mathematics)
A matching of edges in a graph such that no other matching has a greater number of edges. Also known as maximum cardinality matching.
Mentioned in ?
References in periodicals archive ?
The problem of finding a 2 x 2 block diagonal basis can be reduced to the maximum matching problem.
The proposed method was used to determine the maximum matching likelihood.
Further, step 4 shows that each link of NR could only be passed by one unit of flow, and surely it is relevan to the effort of searching the maximum matching of BN-1.
Ravindran [25] identified driver nodes with a maximum matching algorithm and classified the nodes.
The maximum matching H of graph G = (V; E) is called an optimal matching if it achieves the maximum sum weight; that is,
According to the direction of the word, a mechanical sub-lexical is divided into maximum matching method, reverse maximum matching method, least syncopation, two-way matching, and signs segmentation method, etc.
To solve these problems we need to seek the maximum matching which is one of the core issues in matching theory [1-3].
Although sponsors can default people into proper investments, are automate savings and rate hikes, most participants, savings rate likely stops at whatever number corresponds with the maximum matching contribution, typically somewhere around 6%.
This final subproblem may be solved by finding a maximum matching in the following bipartite graph.
We apply these ideas to three problems: maximum matching, graph colouring and Kolmogorov complexity.
Award-winning Hungarian mathematician Lovasz (Eotvos Lorand U., Budapest) and fellow specialist in combinatorics Plummer (mathematics, Vanderbilt U.) discuss matchings in bipartite graphs, network flow theory, the size and structure of maximum matchings, bipartite graphs with perfect matching, some graph theory problems related to matching, matching and linear programming, determinants and matching, matching algorithms, the f-factor problem, matroid matching, and vertex packing and covering.
* Tommy Andersson, Lund University, and Lars Ehlers, Universite de Montreal, "Assigning Refugees to Landlords in Sweden: Stable Maximum Matchings"

Site: Follow: Share:
Open / Close