An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers

DOI10.1007/978-3-319-49259-9_17zbMath1425.68450OpenAlexW2546772114MaRDI QIDQ2007904

Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil

Publication date: 22 November 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-49259-9_17

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (2)

The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs ⋮ Self-Stabilizing Domination Algorithms

This page was built for publication: An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers