Communication complexity of approximate matching in distributed graphs (Q2955016)
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 6677415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of approximate matching in distributed graphs |
scientific article; zbMATH DE number 6677415 |
Statements
24 January 2017
0 references
approximate maximum matching
0 references
distributed computation
0 references
communication complexity
0 references
Communication complexity of approximate matching in distributed graphs (English)
0 references
0.9393852949142456
0 references
0.8430243730545044
0 references
0.833392858505249
0 references
0.8331440687179565
0 references
0.8229957818984985
0 references
