A Decomposition Theorem for Maximum Weight Bipartite Matchings
نویسندگان
چکیده
منابع مشابه
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. T...
متن کامل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...
متن کاملNew Algorithms for Maximum Weight Matching and a Decomposition Theorem
Full terms and conditions of use: http://pubsonline.informs.org/page/terms-and-conditions This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more information, contact [email protected]. The...
متن کاملLinear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
A bipartite graph G = (U, V,E) is convex if the vertices in V can be linearly ordered such that for each vertex u ∈ U , the neighbors of u are consecutive in the ordering of V . An induced matching H of G is a matching such that no edge of E connects endpoints of two different edges of H. We show that in a convex bipartite graph with n vertices and m weighted edges, an induced matching of maxim...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2001
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539799361208