Fast Constructions of Lightweight Spanners for General Graphs

DOI10.1145/2836167zbMath1446.68116arXiv1207.1668OpenAlexW2401485379MaRDI QIDQ4962607

Shay Solomon, Michael Elkin

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.1668

zbMATH Keywords

graph spannerssparse graphslight spanners

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (5)

Online Spanners in Metric Spaces ⋮ Graph spanners: a tutorial review ⋮ The Greedy Spanner Is Existentially Optimal ⋮ Constructing Light Spanners Deterministically in Near-Linear Time ⋮ Constructing light spanners deterministically in near-linear time

This page was built for publication: Fast Constructions of Lightweight Spanners for General Graphs