Robust communication complexity of matching: EDCS achieves 5/6 approximation (Q6638006)
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 7944052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust communication complexity of matching: EDCS achieves 5/6 approximation |
scientific article; zbMATH DE number 7944052 |
Statements
Robust communication complexity of matching: EDCS achieves 5/6 approximation (English)
0 references
14 November 2024
0 references
maximum matching
0 references
robust communication complexity
0 references
edge degree constrained subgraph
0 references
