A self-stabilizing algorithm for \(b\)-matching

DOI10.1016/J.TCS.2018.06.042zbMath1409.68217OpenAlexW2810566016WikidataQ129645697 ScholiaQ129645697MaRDI QIDQ1625602

Orhan Dagdeviren, Can Umut Ileri

Publication date: 29 November 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.042

zbMATH Keywords

distributed algorithmself-stabilization\(b\)-matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient self-stabilizing distance-2 coloring algorithm
• A new self-stabilizing maximal matching algorithm
• A self-stabilizing algorithm for maximal matching
• Maximal matching stabilizes in quadratic time
• Maximal matching stabilizes in time \(O(m)\)
• Compact self-stabilizing leader election for general networks
• A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks
• Dynamic and self-stabilizing distributed matching

This page was built for publication: A self-stabilizing algorithm for \(b\)-matching