A self-stabilizing algorithm for maximal matching in anonymous networks
From MaRDI portal
Publication:4598929
DOI10.1142/S012962641650016XzbMATH Open1376.68164MaRDI QIDQ4598929FDOQ4598929
Authors: Jonas Lefèvre, Khaled Maâmra, Laurence Pilard, Devan Sohier, Johanne Cohen 
Publication date: 15 December 2017
Published in: Parallel Processing Letters (Search for Journal in Brave)
Recommendations
Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)
Cited In (15)
- Title not available (Why is that?)
- An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks
- A self-stabilizing algorithm for maximal matching
- A self-stabilizing algorithm for \(b\)-matching
- Self-stabilization and Byzantine tolerance for maximal matching
- Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
- Brief Announcement
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
- An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
- Maximum matching for anonymous trees with constant space per process
- High Performance Computing - HiPC 2003
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
- Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space
- A self-stabilizing algorithm for maximal matching in link-register model
- Self-Stabilizing Domination Algorithms
This page was built for publication: A self-stabilizing algorithm for maximal matching in anonymous networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598929)
