Graph Spanners: A Tutorial Review

Ahmed, Reyan; Bodwin, Greg; Sahneh, Faryad Darabi; Hamm, Keaton; Jebelli, Mohammad Javad Latifi; Kobourov, Stephen G.; Spence, Ríchard K.

doi:10.48550/arxiv.1909.03152

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 90 publications

(175 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sparse subgraphs of the hypercube with strong distance-preserving properties have been studied extensively in the literature, and have found many practical applications in distributed computing and communication networks. We refer the reader to the recent survey [2].…”

Section: Introductionmentioning

confidence: 99%

Bounded Degree Spanners of the Hypercube

Nenadov¹,

Sawhney²,

Sudakov³

et al. 2019

Preprint

View full text Add to dashboard Cite

In this short note we study two questions about the existence of subgraphs of the hypercube Q n with certain properties. The first question, due to Erdős-Hamburger-Pippert-Weakley, asks whether there exists a bounded degree subgraph of Q n which has diameter n. We answer this question by giving an explicit construction of such a subgraph with maximum degree at most 120.The second problem concerns properties of k-additive spanners of the hypercube, that is, subgraphs of Q n in which the distance between any two vertices is at most k larger than in Q n . Denoting by ∆ k,∞ (n) the minimum possible maximum degree of a k-additive spanner of Q n , Arizumi-Hamburger-Kostochka showed that n ln n e −4k ≤ ∆ 2k,∞ (n) ≤ 20 n ln n ln ln n.We improve their upper bound by showing thatwhere the last term denotes a k + 1-fold iterated logarithm.

show abstract

Section: Introductionmentioning

confidence: 99%