Small Stretch Pairwise Spanners

DOI10.1007/978-3-642-39206-1_51MaRDI QIDQ5326595zbMATH OpenOpenAlexFDO

Authors Telikepalli Kavitha, Nithin M. Varma

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_51

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Small Spans in Scaled Dimension
• Spanners with Slack
• Sometimes Reliable Spanners of Almost Linear Size.
• Sometimes reliable spanners of almost linear size
• Approximating low-stretch spanners
• Dimensions of tight spans
• Light spanners
• Light spanners
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 1809685

Cited in

(13)

• New pairwise spanners
• Graph spanners: a tutorial review
• A fast algorithm for source-wise round-trip spanners
• Terminal embeddings
• Sparse source-wise and pair-wise distance preservers
• New pairwise spanners
• Small stretch pairwise spanners and approximate D-preservers
• Steiner point removal with distortion \(O(\log k)\) using the \texttt{Relaxed-Voronoi} algorithm
• Small Spans in Scaled Dimension
• Bypassing Erdős' girth conjecture: hybrid stretch and sourcewise spanners
• Spanners with Slack
• Scattering and sparse partitions, and their applications
• Scattering and sparse partitions, and their applications

This page was built for publication: Small Stretch Pairwise Spanners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326595)