A Local Computation Approximation Scheme to Maximum Matching
classification
💻 cs.DS
keywords
matchingapproximationcomputationlocalmaximumalgorithmboundeddegree
read the original abstract
We present a polylogarithmic local computation matching algorithm which guarantees a $(1-\eps)$-approximation to the maximum matching in graphs of bounded degree.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.