Maximum matching for anonymous trees with constant space per process

DOI10.4230/LIPICS.OPODIS.2015.16MaRDI QIDQ5363807zbMATH OpenOpenAlexFDO

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

Publication date 29 September 2017

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

zbMATH Keywords

anonymous treemaximum matchingself-stabilizationunfair daemon

Mathematics Subject Classification ID

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

Recommendations

• An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks
• An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
• A self-stabilizing algorithm for maximal matching in anonymous networks
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• scientific article; zbMATH DE number 1735731

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363807)