Local algorithms for bounded degree sparsifiers in sparse graphs (Q4993322)
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 7359389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local algorithms for bounded degree sparsifiers in sparse graphs |
scientific article; zbMATH DE number 7359389 |
Statements
15 June 2021
0 references
arboricity
0 references
bounded degree
0 references
local algorithm
0 references
sparsifier
0 references
0 references
0 references
0 references
Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (English)
0 references
0.7852593064308167
0 references
0.7709677219390869
0 references
0.765583872795105
0 references
0.7606130838394165
0 references
