Distributed approximate maximum matching in the CONGEST model (Q5090895)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7561258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed approximate maximum matching in the CONGEST model |
scientific article; zbMATH DE number 7561258 |
Statements
21 July 2022
0 references
distributed graph algorithms
0 references
maximum matching
0 references
deterministic rounding
0 references
communication complexity
0 references
0 references
Distributed Approximate Maximum Matching in the CONGEST Model. (English)
0 references
0.9087693095207214
0 references
0.8956942558288574
0 references
0.8929121494293213
0 references
0.8888295888900757
0 references
0.8812025189399719
0 references
