Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2782624220 / rank | |||
Normal rank | |||
| Property / title | |||
Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (English) | |||
| Property / title: Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (English) / rank | |||
Normal rank | |||
Revision as of 11:30, 30 July 2024
scientific article; zbMATH DE number 7359389
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
