A Decomposition Theorem for Maximum Weight Bipartite Matchings
نویسنده
چکیده
Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be log x/ log(x/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O( √ nW/k(n,W/N))-time algorithm for computing a maximum weight matching of G. This algorithm bridges a long-standing gap between the best known time complexity of computing a maximum weight matching and that of computing a maximum cardinality matching. Given G and a maximum weight matching of G, we can further compute the weight of a maximum weight matching of G− {u} for all nodes u in O(W ) time.
منابع مشابه
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees
Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be log x/ log(x/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O( √ nW/k(n,W/N))-time algorithm for computing a maximum weight matching of G. T...
متن کاملDecomposition Theorems for Square-free 2-matchings in Bipartite Graphs
The maximum Ck-free 2-matching problem is a problem of finding a maximum simple 2matching which does not contain cycles of length k or less in undirected graphs. The complexity of the problem varies due to k and the input graph. The case where k = 4 and the graph is bipartite, which is called the maximum square-free 2-matching problem in bipartite graphs, is well-solved. Previous results on thi...
متن کاملTwo-sided popular matchings in bipartite graphs with forbidden/forced elements and weights
Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fair...
متن کاملFinding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
We introduce a new framework of restricted 2-matchings close to Hamilton cycles. For an undirected graph (V,E) and a family U of vertex subsets, a 2-matching F is called U-feasible if, for each U ∈ U , F contains at most |U | − 1 edges in the subgraph induced by U . Our framework includes C≤k-free 2-matchings, i.e., 2-matchings without cycles of at most k edges, and 2-factors covering prescribe...
متن کاملRestricted t-matchings in Bipartite Graphs
The results contained in this paper were achieved in 1999, when the author participated the ,,Workshop on Matroids, Matching and Extensions” in Waterloo, Canada. This paper was written and distributed in 2001, when the author gave an EIDMA minicurse in Eindhoven, Netherlands. This is the uncorrected original version, except, that we added an Appendix containing the NP-completeness proof for the...
متن کامل