Parallel Processing Letters Bipartite Expander Matching Is in Nc
نویسنده
چکیده
A work-eecient deterministic NC algorithm is presented for nding a maximum matching in a bipartite expander graph with any expansion factor > 1. This improves upon a recently presented deterministic NC maximum matching algorithm which is restricted to those bipartite expanders with large expansion factors (; > 0), and is not work-eecient 1].
منابع مشابه
The Parallel Complexity of Positive Linear Programming
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the special case of Linear Programming in packing/covering form where the input constraint matrix and constraint vector consist entirely of positive entries. We show that the problem of exactly solving PLP is P-complete. Luby and Nisan gave an NC approximation algorithm for PLP, and their algorithm can be ...
متن کاملPerfect Bipartite Matching in Pseudo-Deterministic RNC
In this paper we present a pseudo-deterministic RNC algorithm for finding perfect matchings in bipartite graphs. Specifically, our algorithm is a randomized parallel algorithm which uses poly(n) processors, poly(log n) depth, poly(log n) random bits, and outputs for each bipartite input graph a unique perfect matching with high probability. That is, it returns the same matching for almost all r...
متن کاملThe Polynomially Bounded Perfect Matching Problem Is in NC 2
The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent open questions in complexity theory regarding parallel computations. Grigoriev and Karpinski [GK87] studied the perfect matching problem for bipartite graphs with polynomially bounded permanent. They showed that for such bipartite ...
متن کاملA note on the hardness results for the labeled perfect matching problems in bipartite graphs
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters 96 (2005) 81-88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based...
متن کاملSome perfect matchings and perfect half-integral matchings in NC
We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can be found in NC for planar bipartite graphs and K3,3-free bipartite graphs via this approach. A crucial ingredient is part of an interior-point...
متن کامل