The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (Q2420642)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs |
scientific article |
Statements
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (English)
0 references
6 June 2019
0 references
self-stabilization
0 references
1-maximal matching
0 references
\(\frac{2}{3}\)-approximation
0 references
0 references
0 references
0 references
0 references
