16. Sparse Spanners for Unweighted Graphs

David Peleg · Society for Industrial and Applied Mathematics eBooks · 2000

In this chapter we discuss some upper and lower bounds concerning the existence and efficient constructability of sparse spanners for general unweighted graphs, as well as examples of various specific families of unweighted graphs, including chordal graphs and hypercubes.

Read the paper · More papers on PaperTik