Bipartite Maximum-Weight Matching: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of vertices | $n$: number of vertices | ||
m: number of edges | $m$: number of edges | ||
N: largest weight magnitude | $N$: largest weight magnitude | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 26: | Line 26: | ||
| [[Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching)|Hungarian algorithm]] || 1955 || $O(n^{4})$ || $O(n^{2})$ || Exact || Deterministic || [https://web.eecs.umich.edu/~pettie/matching/Kuhn-hungarian-assignment.pdf Time] | | [[Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching)|Hungarian algorithm]] || 1955 || $O(n^{4})$ || $O(n^{2})$ || Exact || Deterministic || [https://web.eecs.umich.edu/~pettie/matching/Kuhn-hungarian-assignment.pdf Time] | ||
|- | |- | ||
| [[Micali; Vazirani ( Maximum-Weight Matching)|Micali; Vazirani]] || 1980 || $O(n^{3} | | [[Micali; Vazirani ( Maximum-Weight Matching)|Micali; Vazirani]] || 1980 || $O(n^{3} \log n)$ || || Exact || Deterministic || [https://ieeexplore.ieee.org/document/4567800 Time] | ||
|- | |- | ||
| [[Mucha and Sankowski ( Maximum-Weight Matching)|Mucha and Sankowski]] || 2004 || $O(n^{3})$ || || Exact || Deterministic || [https://dl.acm.org/doi/10.1109/FOCS.2004.40 Time] | | [[Mucha and Sankowski ( Maximum-Weight Matching)|Mucha and Sankowski]] || 2004 || $O(n^{3})$ || || Exact || Deterministic || [https://dl.acm.org/doi/10.1109/FOCS.2004.40 Time] | ||
| Line 35: | Line 35: | ||
[[File:Maximum-Weight Matching - Bipartite Maximum-Weight Matching - Time.png|1000px]] | [[File:Maximum-Weight Matching - Bipartite Maximum-Weight Matching - Time.png|1000px]] | ||
Latest revision as of 09:08, 28 April 2023
Description
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 must be bipartite.
Related Problems
Generalizations: Maximum-Weight Matching
Parameters
$n$: number of vertices
$m$: number of edges
$N$: largest weight magnitude
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Hungarian algorithm | 1955 | $O(n^{4})$ | $O(n^{2})$ | Exact | Deterministic | Time |
| Micali; Vazirani | 1980 | $O(n^{3} \log n)$ | Exact | Deterministic | Time | |
| Mucha and Sankowski | 2004 | $O(n^{3})$ | Exact | Deterministic | Time |
Time Complexity Graph
