An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks

DOI10.1007/978-3-319-69084-1_7zbMath1498.68370OpenAlexW2763766235MaRDI QIDQ5045435

Sébastien Tixeuil, Michiko Inoue, Fukuhito Ooshita

Publication date: 4 November 2022

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

Full work available at URL: https://doi.org/10.1007/978-3-319-69084-1_7

zbMATH Keywords

self-stabilizationarbitrary networksunfair distributed daemon1-maximal matching algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (1)

Self-Stabilizing Domination Algorithms

This page was built for publication: An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks