Local computation algorithms for spanners
© Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee. A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-...
| स्वरूप: | लेख |
|---|---|
| भाषा: | English |
| प्रकाशित: |
2021
|
| ऑनलाइन पहुंच: | https://hdl.handle.net/1721.1/137345 |