Spanner
β Scribed by Corbett, James C. ;Dean, Jeffrey ;Epstein, Michael ;Fikes, Andrew ;Frost, Christopher ;Furman, J. J. ;Ghemawat, Sanjay ;Gubarev, Andrey ;Heiser, Christopher ;Hochschild, Peter ;Hsieh, Wilson ;Kanthak, Sebastian ;Kogan, Eugene ;Li, Hongyi ;Lloyd, Alexander ;Melnik, Sergey ;Mwaura, David ;Nagle, David ;Quinlan, Sean ;Rao, Rajesh ;Rolig, Lindsay ;Saito, Yasushi ;Szymaniak, Michal ;Taylor, Christopher ;Wang, Ruth ;Woodford, Dale
- Book ID
- 121723019
- Publisher
- Association for Computing Machinery
- Year
- 2013
- Tongue
- English
- Weight
- 361 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0734-2071
- DOI
- 10.1145/2491245
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given a graph G = (V E), a subgraph G' = (V E ' ) is a t-spanner of G if for every u, u E V the distance from u to u in G' is at most t times longer than that distance in G. This paper presents some results concerning the existence and efficient constructability of sparse spanners for various classe