Sublinear graph approximation algorithms (Q4933367)
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 5799056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear graph approximation algorithms |
scientific article; zbMATH DE number 5799056 |
Statements
Sublinear Graph Approximation Algorithms (English)
0 references
12 October 2010
0 references
constant-time algorithms
0 references
maximum matching
0 references
vertex cover
0 references
minor-freeness
0 references
hereditary properties
0 references
0 references
0.8122311234474182
0 references
0.8026852011680603
0 references
0.7905593514442444
0 references
0.7853310704231262
0 references
0.7834577560424805
0 references
