Distributed local approximation algorithms for maximum matching in graphs and hypergraphs (Q5115699)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Distributed local approximation algorithms for maximum matching in graphs and hypergraphs |
scientific article; zbMATH DE number 7236281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed local approximation algorithms for maximum matching in graphs and hypergraphs |
scientific article; zbMATH DE number 7236281 |
Statements
Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (English)
0 references
18 August 2020
0 references
matching
0 references
hypergraph
0 references
edge coloring
0 references
derandomization
0 references
Nash-Williams decomposition
0 references
LOCAL
0 references
0 references
0 references
0.8834684491157532
0 references
0.8769606947898865
0 references
0.8685435056686401
0 references
0.861789345741272
0 references
0.8617143630981445
0 references
