Bipartite 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 must be bipartite.

Parameters

$n$ : number of vertices
$m$ : number of edges
$N$ : largest weight magnitude

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 1 of 1 algorithms

				See more
Hungarian algorithm	1955	$O(n^4)$	$O(n^2)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms