Algorithms – ESA 2005
From MaRDI portal
Publication:5475865
DOI10.1007/11561071zbMath1162.68833OpenAlexW2501059503MaRDI 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
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (7)
\( \delta \)-greedy \(t\)-spanner ⋮ Computing the Greedy Spanner in Near-Quadratic Time ⋮ Computing the greedy spanner in near-quadratic time ⋮ Sparse geometric graphs with small dilation ⋮ Light Euclidean Spanners with Steiner Points ⋮ Computing a minimum-dilation spanning tree is NP-hard ⋮ The Greedy Spanner Is Existentially Optimal
This page was built for publication: Algorithms – ESA 2005
