376 search results - page 76 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...