A Deterministic Parallel Algorithm for Bipartite Perfect Matching
In this article, we give an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs.
A Deterministic Parallel Algorithm for Bipartite Perfect Matching
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved