A faster distributed algorithm for computing maximal matchings deterministically
DOI10.1145/301308.301360zbMath1321.68469OpenAlexW2074629498MaRDI QIDQ2942765
Michał Karoński, Alessandro Panconesi, Michał Hanćkowiak
Publication date: 11 September 2015
Published in: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301308.301360
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) 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) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (5)
This page was built for publication: A faster distributed algorithm for computing maximal matchings deterministically