An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks

DOI10.1007/978-3-319-15612-5_17zbMath1432.68551OpenAlexW205303381MaRDI QIDQ5176583

Yuma Asada, Michiko Inoue

Publication date: 27 February 2015

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

graph theorymatching problemdistributed algorithmself-stabilization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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 Algorithm for 1-Maximal Matching in Anonymous Networks