Skip to Main content Skip to Navigation
Journal articles

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

Johanne Cohen 1 Jonas Lefèvre Khaled Maamra 2 George Manoussakis 3 Laurence Pilard 2 
1 GALaC - LRI - Graphes, Algorithmes et Combinatoire (LRI)
LRI - Laboratoire de Recherche en Informatique
2 LI-PaRAD - Laboratoire d'Informatique Parallélisme Réseaux Algorithmes Distribués
3 LRI - Laboratoire de Recherche en Informatique
Document type :
Journal articles
Complete list of metadata
https://hal.archives-ouvertes.fr/hal-02365373
Contributor : Accord Elsevier CCSD Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 10:43:40 AM
Last modification on : Saturday, June 25, 2022 - 10:52:43 PM
Long-term archiving on: : Wednesday, January 26, 2022 - 7:01:26 PM

File

Vignette du document
S0304397519301379.pdf
Files produced by the author(s)

Licence

Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License
Elsevier-hosted Accepted Manuscript

Identifiers

Collections

CNRS | UMR8623 | UVSQ | CENTRALESUPELEC | LRI-GALAC | UNIV-PARIS-SACLAY | LI-PARAD | LISN | GS-ENGINEERING | GS-COMPUTER-SCIENCE | LISN-GALAC

Citation

Johanne Cohen, Jonas Lefèvre, Khaled Maamra, George Manoussakis, Laurence Pilard. The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs. Theoretical Computer Science, Elsevier, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩. ⟨hal-02365373⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

75

Files downloads

18