Self-stabilization and Byzantine tolerance for maximal matching

DOI10.1007/978-3-030-03232-6_6zbMath1519.68019OpenAlexW2896686281MaRDI QIDQ6165829

Laurence Pilard, Stephan Kunne, Johanne Cohen

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

matchingrandomized algorithmself-stabilizationByzantine faults

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 systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)

Related Items (1)

Distributed backup placement

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