A Local Computation Approximation Scheme to Maximum Matching

Abstract

We present a polylogarithmic local computation matching algorithm which guarantees a $(1-\eps)$-approximation to the maximum matching in graphs of bounded degree.