Communication complexity of approximate maximum matching in the message-passing model (Q2220400)
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 7300287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of approximate maximum matching in the message-passing model |
scientific article; zbMATH DE number 7300287 |
Statements
Communication complexity of approximate maximum matching in the message-passing model (English)
0 references
22 January 2021
0 references
approximate maximum matching
0 references
multi-party communication complexity
0 references
message passing
0 references
0 references
0.9393852949142456
0 references
0.8532687425613403
0 references
0.804816484451294
0 references
0.7934308052062988
0 references
