Self-stabilization and Byzantine tolerance for maximal matching

DOI10.1007/978-3-030-03232-6_6MaRDI QIDQ6165829zbMATH OpenOpenAlexFDO

Authors Stephan Kunne, Johanne Cohen, Laurence Pilard

Publication date 2 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-03232-6_6

zbMATH Keywords

Byzantine faultsmatchingrandomized algorithmself-stabilization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

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

Cited in

(3)

• Distributed backup placement
• The impact of topology on Byzantine containment in stabilization
• Principles of Distributed Systems

This page was built for publication: Self-stabilization and Byzantine tolerance for maximal matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165829)