Maximum-Weight Matching
In computer science, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. Here, the graph is unrestricted; i.e. can be any general graph.
Parameters
- : number of vertices
- : number of edges
- : largest weight magnitude
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 1 of 1 algorithms
| See more | ||||
|---|---|---|---|---|
| Edmonds | 1965 |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table