@inproceedings{0176e763079f4618b90c4fc984e9789a,
title = "A self-stabilizing algorithm for maximal matching in link-register model",
abstract = " This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the link-register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm A 1 under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt A 1 so that it can handle the fair distributed daemon, leading to the A 2 algorithm. We prove that algorithm A 1 stabilizes in O(mΔ) moves and algorithm A 2 in O(mΔ) rounds, with Δ the maximum degree and m the number of edges.",
author = "Johanne Cohen and George Manoussakis and Laurence Pilard and Devan Sohier",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 ; Conference date: 18-06-2018 Through 21-06-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-030-01325-7_2",
language = "English",
isbn = "9783030013240",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "14--19",
editor = "Zvi Lotker and Boaz Patt-Shamir",
booktitle = "25th International Colloquium, SIROCCO 2018, Revised Selected Papers",
address = "Germany",
}