Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (1) , 210-236
- https://doi.org/10.1137/s0097539794261295
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- High-Probability Parallel Transitive-Closure AlgorithmsSIAM Journal on Computing, 1991
- An Optimal Synchronizer for the HypercubeSIAM Journal on Computing, 1989
- Graph spannersJournal of Graph Theory, 1989
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952