Výsledky vyhledávání - "Khaled Maâmra"

The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs

Autor: Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, Laurence Pilard, George Manoussakis

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩

We present the first polynomial self-stabilizing algorithm for finding a 1-maximal matching in a general graph. The previous best known algorithm has been presented by Manne et al. [20] and we show in this paper it has a sub-exponential time complexi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f731b15e3c22225164d0112af0574b4b
https://doi.org/10.1016/j.tcs.2019.02.031

Zobrazit plný text záznamu

A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks

Autor: Khaled Maâmra, Laurence Pilard, Johanne Cohen, Jonas Lefèvre, Devan Sohier

Publikováno v: Parallel Processing Letters
Parallel Processing Letters, World Scientific Publishing, 2016, 26 (04), ⟨10.1142/S012962641650016X⟩
Parallel Processing Letters, World Scientific Publishing, 2016, Parallel Processing Letters, 26, ⟨10.1142/S012962641650016X⟩
Parallel Processing Letters, 2016, Parallel Processing Letters, 26, ⟨10.1142/S012962641650016X⟩

We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is O(2) moves with high probability, under the adversarial distributed daemon. Among all adversarial distributed daemons and with the ano

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d65c55a8036caba596859e264896bada
https://hal.archives-ouvertes.fr/hal-01758046

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání