Skip to main content
Conference Proceedings

A local computation approximation scheme to maximum matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8096 LNCS 260-273
DOI: 10.1007/978-3-642-40328-6_19
46Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a polylogarithmic local computation matching algorithm which guarantees a (1 - ε)-approximation to the maximum matching in graphs of bounded degree. © 2013 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Mansour, Y., & Vardi, S. (2013). A local computation approximation scheme to maximum matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8096 LNCS, pp. 260–273). https://doi.org/10.1007/978-3-642-40328-6_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free