Publication:4886051
From MaRDI portal
zbMath0849.68090MaRDI QIDQ4886051
Giri Narasimhan, Jeffrey S. Salowe, Gautam K. Das
Publication date: 4 November 1996
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Efficient construction of a bounded-degree spanner with low weight, Euclidean Steiner Spanners: Light and Sparse, Local routing in sparse and lightweight geometric graphs, Truly Optimal Euclidean Spanners, Minimum weight Euclidean \(t\)-spanner is NP-hard, Minimum weight Euclidean \((1+\varepsilon)\)-spanners, Minimum weight Euclidean \((1+\varepsilon)\)-spanners, On certain geometric properties of the Yao-Yao graphs, Light Euclidean Spanners with Steiner Points, The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension