On sparse spanners of weighted graphs
1993
Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for construct...
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
18
Citations
NaN
KQI