Amir LeshemOshri NaparstekExpected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs," in Random Structures & Algorithms. Wiley Online Library, 2014.
We give a simple O(r(m+n))-time algorithm to update an existing rank-maximal matching under each of these changes. When r = o(n), this is faster than recomputing a rank-maximal matching completely using a known algorithm like that of Irving et al., which takes time O(min((r + ...
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problemdoi:10.1016/j.ipl.2011.02.006ApproximationalgorithmsMatchingEdge-coloringWe consider the minimum maximal matching problem, which is NP -hard (Yannakakis and Gavril (1980) [18]). Given an unweighted simple ...
M1 is also a maximum matching, while M2 is not. Max2d selects a matching in Θt(N) time with Θx(N) spatial complexity, where N is the number of input ports and the number of output ports. This matching algorithm is guaranteed to find a maximal matching among a set of N2 possible...
In this work we show how the reduction to the weight matching problem can also be used to achieve the same running time. Our algorithm is simpler and more intuitive.doi:10.1016/j.tcs.2007.08.004Dimitrios MichailElsevier Science Publishers Ltd.Theoretical Computer Science...
We present a new algorithm which detects the maximal possible number of matched disjoint pairs satisfying a given caliper when a bipartite matching is done with respect to a scalar index (e.g., propensity score), and constructs a corresponding matching. Variable width calipers are compatible with...
Maximal matchingGraphsIn this paper we show that if t b(n,m) is the parallel time taken for computing a matching in a bipartite graph (incident with a fraction of edges) by a parallel work-optimal algorithm and if there is an algorithm A to compute a maximal matching in a general ...
Our algorithm is simpler and more intuitive. (c) 2007 Elsevier B.V All rights reserved.Michail DTheoretical computer scienceMichail, D., 2007. Reducing rank-maximal to maximum weight matching. Theoretical Computer Science 389 (1-2), 125-132....
Our result implies that all maximal induced matchings in an n-vertex triangle-free graph can be listed in time O(1.4423n), yielding the fastest known algorithm for finding a maximum induced matching in a triangle-free graph.Manu Basavaraju...
We give a combinatorial algorithm for the capacitated version of the rank-maximal matching problem, in which each applicant or post v has capacity b(v). The algorithm runs in O(min(B, C B~(1/2))m) time, where C is the maximal rank of an edge in an optimal solution and B = min...