A local algorithm for constructing spanners in minor-free graphs (Q4636471)
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 6861923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local algorithm for constructing spanners in minor-free graphs |
scientific article; zbMATH DE number 6861923 |
Statements
19 April 2018
0 references
spanners
0 references
sparse subgraphs
0 references
local algorithms
0 references
excluded-minor
0 references
A Local Algorithm for Constructing Spanners in Minor-Free Graphs (English)
0 references
0.9120173454284668
0 references
0.8381252884864807
0 references
0.8358914852142334
0 references
0.7893227338790894
0 references
