A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Sparse Hypercube 3-spanners
2000
Discrete Applied Mathematics
A t-spanner of a graph G = (V; E), is a sub-graph SG = (V; E ), such that E ⊆ E and for every edge {u; v} ∈ E, there is a path from u to v in SG of length at most t. A minimum-edge t-spanner of a graph G, S G , is the t-spanner of G with the fewest edges. For general graphs and for t = 2, the problem of determining for a given integer s, whether |E(S G )|6s is NP-Complete (Peleg and Scha er, J. Graph Theory 13(1) (1989) 99 -116). Peleg and Ullman (SIAM J. Comput. 18(4) (1989) 740 -747), give a
doi:10.1016/s0166-218x(99)00246-2
fatcat:wezq7n547vgbvne3aj6xnoanuy