Abstract
Given an unweighted undirected graph G = (V, E), and a pair of parameters ε > 0, β = 1, 2, . . ., a subgraph G 0 = (V, H), H ⊆ E, of G is a (1 + ε, β)-spanner (aka, a near-additive spanner) of G if for every u, v ∈ V ,
| Original language | English |
|---|---|
| Volume | 130 |
| DOIs | |
| State | Published - 21 Jan 2020 |
Keywords
- Computer Science - Data Structures and Algorithms
Fingerprint
Dive into the research topics of 'Near-Additive Spanners and Near-Exact Hopsets, A Unified View'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver