A simple and efficient method for accelerating construction of the gap-greedy spanner

DOI10.1142/S0129054123500119MaRDI QIDQ6554737

Hosein Salami, Mostafa Nouri-Baygi

Publication date: 13 June 2024

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

geometric spannerswell-separated pair decompositiongap greedy

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)

Cites Work

• Distribution-sensitive construction of the greedy spanner
• Computing the greedy spanner in linear space
• Efficient construction of a bounded-degree spanner with low weight
• An optimal algorithm for computing angle-constrained spanners
• Geometric Spanner Networks
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A Framework for Computing the Greedy Spanner

This page was built for publication: A simple and efficient method for accelerating construction of the gap-greedy spanner

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