A self-stabilizing algorithm for maximal matching in anonymous networks

DOI10.1142/S012962641650016XMaRDI QIDQ4598929zbMATH OpenFDO

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)

zbMATH Keywords

randomized algorithmself-stabilizationmaximal matchinganonymous network

Mathematics Subject Classification ID

Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)

Recommendations

• An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
• An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks

Cited in

(15)

• Self-Stabilizing Domination Algorithms
• scientific article; zbMATH DE number 1863300 (Why is no real title available?)
• 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
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• Brief Announcement
• 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

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)