Maximum Matching in Weighted Bipartite Graphs
نویسندگان
چکیده
منابع مشابه
Maximum semi-matching problem in bipartite graphs
An (f, g)-semi-matching in a bipartite graph G = (U ∪V,E) is a set of edges M ⊆ E such that each vertex u ∈ U is incident with at most f(u) edges of M , and each vertex v ∈ V is incident with at most g(v) edges of M . In this paper we give an algorithm that for a graph with n vertices and m edges, n ≤ m, constructs a maximum (f, g)semi-matching in running time O(m ·min( √∑ u∈U f(u), √∑ v∈V g(v)...
متن کاملA Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs
The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic a...
متن کاملCoarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = (A;B;E). For p processors with N=p memory per processor, N = jAj+ jBj, N=p p, the algorithm requires O(log p) communication rounds and O(Tsequ(np ; m p ) + n p log p) local computation, where n = jAj, m = jBj and Tsequ(n;m) is the sequential time complexity for the problem. For the BS...
متن کاملDetermining All Maximum Uniquely Restricted Matching in Bipartite Graphs
The approach mapping from a matching of bipartite graphs to digraphs has been successfully used for forcing set problem, in this paper, it is extended to uniquely restricted matching problem. We show to determine a uniquely restricted matching in a bipartite graph is equivalent to recognition a acyclic digraph. Based on these results, it proves that determine the bipartite graphs with all maxim...
متن کاملA scaling algorithm for maximum weight matching in bipartite graphs
Given a weighted bipartite graph, the maximum weight matching (MWM) problem is to find a set of vertex-disjoint edges with maximum weight. We present a new scaling algorithm that runs in O(m √ n logN) time, when the weights are integers within the range of [0, N ]. The result improves the previous bounds of O(Nm √ n) by Gabow and O(m √ n log (nN)) by Gabow and Tarjan over 20 years ago. Our impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kibernetika i vyčislitelʹnaâ tehnika
سال: 2018
ISSN: 0454-9910,2519-2205
DOI: 10.15407/kvt191.01.032