Experimental Study of Geometric t-Spanners: A Running Time Comparison

DOI10.1007/978-3-540-72845-0_21MaRDI QIDQ5432320zbMATH OpenOpenAlexFDO

Authors Mohammad Farshi, Joachim Gudmundsson

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_21

Mathematics Subject Classification ID

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

Recommendations

• Experimental study of geometric \(t\)-spanners
• Algorithms – ESA 2005
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Efficient construction of a bounded-degree spanner with low weight
• STACS 2005

Cited in

(6)

• Computing the greedy spanner in near-quadratic time
• Computing the Greedy Spanner in Near-Quadratic Time
• Experimental study of geometric \(t\)-spanners
• Algorithms – ESA 2005
• Light Euclidean Spanners with Steiner Points
• \( \delta \)-greedy \(t\)-spanner

This page was built for publication: Experimental Study of Geometric t-Spanners: A Running Time Comparison

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