(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Given a graph G = (V,E), a subgraph G? = (V,H), H I E is a k-spanner (respectively, k-DSS) of G if for any pair of vertices u,w I V it satisfies dsub/subsub/subsub/sub