Improved deterministic distributed matching via rounding
From MaRDI portal
Publication:6487488
DOI10.4230/lipics.disc.2017.17zbMath1515.68366MaRDI QIDQ6487488
Publication date: 3 February 2023
maximal matchingdistributed graph algorithmsdeterministic distributed algorithmsmaximum matching approximationrounding linear programs
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)
This page was built for publication: Improved deterministic distributed matching via rounding