We give a deterministic distributed approximation algorithm for the maximum matching problem in graphs of bounded arboricity. Specifically, given 0
CITATION STYLE
Czygrinow, A., Hańćkowiak, M., & Szymańska, E. (2009). Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 668–678). https://doi.org/10.1007/978-3-642-10631-6_68
Mendeley helps you to discover research relevant for your work.