The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs - Equipe : Graphes, Algorithmes et Combinatoire Access content directly
Journal Articles Theoretical Computer Science Year : 2019

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

Domains

Computer science
Fichier principal
Vignette du fichier
S0304397519301379.pdf (677.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Accord Elsevier CCSD  : Connect in order to contact the contributor

https://hal.science/hal-02365373

Submitted on : Monday, October 25, 2021-10:43:40 AM

Last modification on : Monday, February 12, 2024-9:38:03 AM

Long-term archiving on: Wednesday, January 26, 2022-7:01:26 PM

Download

Dates and versions

hal-02365373 , version 1 (25-10-2021)

Licence

Attribution - NonCommercial

Identifiers

Elsevier-hosted Accepted Manuscript

Cite

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, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩. ⟨hal-02365373⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UMR8623 UVSQ CENTRALESUPELEC LRI-GALAC UNIV-PARIS-SACLAY LI-PARAD LISN GS-ENGINEERING GS-COMPUTER-SCIENCE LISN-GALAC
121 View
42 Download

Altmetric

Share

Gmail Facebook X LinkedIn More