An optimal-time construction of sparse Euclidean spanners with tiny diameter

MaRDI QIDQ5365084zbMATH OpenFDO

Authors Shay Solomon

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133101

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Sparse Euclidean Spanners with Tiny Diameter
• Optimal Euclidean spanners, really short, thin and lanky
• Optimal Euclidean Spanners

Cited in

(8)

• Sparse Euclidean Spanners with Tiny Diameter
• Optimal Euclidean Spanners
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• scientific article; zbMATH DE number 7238981 (Why is no real title available?)
• Optimal Euclidean spanners, really short, thin and lanky
• Sparse Euclidean spanners with tiny diameter: a tight lower bound
• Sparse Euclidean spanners with optimal diameter: a general and robust lower bound via a concave inverse-Ackermann function

This page was built for publication: An optimal-time construction of sparse Euclidean spanners with tiny diameter

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