DMCA
Streaming algorithm for graph spanners - single pass and constant processing time per edge
by
Surender Baswana
| Venue: | Inf. Process. Lett |
| Citations: | 11 - 1 self |
BibTeX
@ARTICLE{Baswana_streamingalgorithm,
author = {Surender Baswana},
title = {Streaming algorithm for graph spanners - single pass and constant processing time per edge},
journal = {Inf. Process. Lett},
year = {},
pages = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A spanner is a sparse subgraph of a given graph that preserves approximate distance between each pair of vertices. In precise words, a t-spanner of a graph G = (V,E), for any t ∈ N, is a subgraph (V,ES), ES ⊆ E
