Efficient Distributed Weighted Matchings on Trees
From MaRDI portal
Publication:3613648
DOI10.1007/11780823_10zbMath1222.68412OpenAlexW2117761060MaRDI QIDQ3613648
Zvi Lotker, Jaap-Henk Hoepman, Shay Kutten
Publication date: 12 March 2009
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11780823_10
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items
Almost stable matchings by truncating the Gale-Shapley algorithm, A simple local 3-approximation algorithm for vertex cover, Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs