A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks
From MaRDI portal
Publication:4598929
DOI10.1142/S012962641650016XzbMath1376.68164MaRDI QIDQ4598929
Devan Sohier, Jonas Lefèvre, Khaled Maâmra, Laurence Pilard, Johanne Cohen
Publication date: 15 December 2017
Published in: Parallel Processing Letters (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20)
Related Items (3)
A self-stabilizing algorithm for \(b\)-matching ⋮ The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs ⋮ Self-Stabilizing Domination Algorithms
This page was built for publication: A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks