Dynamic and self-stabilizing distributed matching

DOI10.1145/571825.571877zbMath1292.68011OpenAlexW2101703048MaRDI QIDQ5170890

Karen Seyffarth, Lisa Higham, Subhendu Chattopadhyay

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/571825.571877

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (7)

A self-stabilizing algorithm for \(b\)-matching ⋮ The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks ⋮ A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 ⋮ A new self-stabilizing maximal matching algorithm ⋮ Stabilizing maximum matching in bipartite networks

This page was built for publication: Dynamic and self-stabilizing distributed matching