Testing Euclidean Spanners

DOI10.1007/978-3-642-15775-2_6MaRDI QIDQ3586451zbMATH OpenOpenAlexFDO

Authors Frank Hellweg, Melanie Schmidt, Christian Sohler

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15775-2_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Testing Euclidean Spanners
• Testing Euclidean minimum spanning trees in the plane
• Euclidean spanners in high dimensions
• Online Euclidean Spanners
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• Sparse Euclidean Spanners with Tiny Diameter
• Lower bound for sparse Euclidean spanners
• scientific article; zbMATH DE number 1263225
• Lower bounds for testing Euclidean minimum spanning trees

Cited in

(3)

• Lower bounds for testing Euclidean minimum spanning trees
• Testing Euclidean minimum spanning trees in the plane
• Online Euclidean Spanners

This page was built for publication: Testing Euclidean Spanners

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