Before revision: Given a weighted bipartite graph with n vertices and m edges, the \mathit{maximum~weight~bipartite~matching problem is to find a set of vertex-disjoint edges with the maximum weight.
After revision: Given a weighted bipartite graph with n vertices and m edges, the maximum weight bipartite matching problem is to find a set of vertex-disjoint edges with the maximum weight.