CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
From MaRDI portal
Publication:3986395
DOI10.1142/S0218195991000098zbMath0738.05040OpenAlexW2106110423MaRDI QIDQ3986395
Publication date: 27 June 1992
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195991000098
Related Items (14)
Efficient construction of a bounded-degree spanner with low weight ⋮ Euclidean spanner graphs with degree four ⋮ An Optimal Dynamic Spanner for Doubling Metric Spaces ⋮ Sparse geometric graphs with small dilation ⋮ I/O-efficient algorithms for computing planar geometric spanners ⋮ Computing a minimum-dilation spanning tree is NP-hard ⋮ Small hop-diameter sparse spanners for doubling metrics ⋮ Lower bounds for computing geometric spanners and approximate shortest paths ⋮ MIXED SPANNING TREES IN THEORY AND PRACTICE ⋮ Spanners of Complete k-Partite Geometric Graphs ⋮ ON SPANNERS OF GEOMETRIC GRAPHS ⋮ Region-fault tolerant geometric spanners ⋮ Fully dynamic geometric spanners ⋮ Average stretch factor: how low does it go?
This page was built for publication: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
