Maximum Matching for Anonymous Trees with Constant Space per Process

DOI10.4230/LIPIcs.OPODIS.2015.16zbMath1380.68026OpenAlexW2578511128MaRDI QIDQ5363807

Toshimitsu Masuzawa, Lawrence L. Larmore, Ajoy K. Datta

Publication date: 29 September 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.OPODIS.2015.16

zbMATH Keywords

maximum matchingself-stabilizationunfair daemonanonymous tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

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: Maximum Matching for Anonymous Trees with Constant Space per Process