Local algorithms for sparse spanning graphs (Q2300722)
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 7175604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local algorithms for sparse spanning graphs |
scientific article; zbMATH DE number 7175604 |
Statements
Local algorithms for sparse spanning graphs (English)
0 references
28 February 2020
0 references
sublinear algorithms
0 references
local algorithms
0 references
sparse spanning subgraphs
0 references
minor-free graphs
0 references
property testing
0 references
bounded degree model
0 references
0 references
0 references
0 references
0 references
0 references
0.949356734752655
0 references
0.9120173454284668
0 references
0.8909814357757568
0 references
0.7852593064308167
0 references
