A self-stabilizing algorithm for maximal matching in link-register model

DOI10.1007/978-3-030-01325-7_2OpenAlexW2898919364MaRDI QIDQ1713878FDOQ1713878

Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier 

Publication date: 30 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-01325-7_2

Recommendations

• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks
• A self-stabilizing algorithm for maximal matching in anonymous networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

Cited In (3)

• Dynamic and self-stabilizing distributed matching
• A new self-stabilizing maximal matching algorithm
• A self-stabilizing algorithm for maximal matching

This page was built for publication: A self-stabilizing algorithm for maximal matching in link-register model

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