Algorithms – ESA 2005
From MaRDI portal
Publication:5475865
DOI10.1007/11561071zbMath1162.68833MaRDI QIDQ5475865
Joachim Gudmundsson, Mohammad Farshi
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
The Greedy Spanner Is Existentially Optimal, Light Euclidean Spanners with Steiner Points, \( \delta \)-greedy \(t\)-spanner, Sparse geometric graphs with small dilation, Computing a minimum-dilation spanning tree is NP-hard, Computing the greedy spanner in near-quadratic time, Computing the Greedy Spanner in Near-Quadratic Time