Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs (Q3652253)
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: Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs |
scientific article; zbMATH DE number 5649419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs |
scientific article; zbMATH DE number 5649419 |
Statements
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs (English)
0 references
17 December 2009
0 references
deterministic distributed approximation algorithm
0 references
maximum matching problem
0 references
graphs of bounded arboricity
0 references
0.8682221174240112
0 references
0.8508915901184082
0 references
0.8414140939712524
0 references
0.8406773805618286
0 references
0.8405410647392273
0 references
