Distributed Algorithm for Better Approximation of the Maximum Matching

DOI10.1007/3-540-45071-8_26zbMath1276.05112OpenAlexW1595681210MaRDI QIDQ3082932

Andrzej Czygrinow, Michał Hanćkowiak

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_26

zbMATH Keywords

algorithmmaximum matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (4)

Distributed algorithms for weighted problems in sparse graphs ⋮ Improved deterministic distributed matching via rounding ⋮ Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs ⋮ Distributed Approximate Maximum Matching in the CONGEST Model.

This page was built for publication: Distributed Algorithm for Better Approximation of the Maximum Matching