Spanners in randomly weighted graphs: independent edge lengths
From MaRDI portal
Publication:2065765
Abstract: Given a connected graph and a length function we let denote the shortest distance between vertex and vertex . A -spanner is a subset such that if denotes shortest distances in the subgraph then for all . We show that for a large class of graphs with suitable degree and expansion properties with independent exponential mean one edge lengths, there is w.h.p.~a 1-spanner that uses edges and that this is best possible. In particular, our result applies to the random graphs for .
Recommendations
Cites work
- A note on two problems in connexion with graphs
- Graph spanners: a tutorial review
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- The effect of adding randomly weighted edges
- Traveling in randomly embedded random graphs
- Weak disorder asymptotics in the stochastic mean-field model of distance
This page was built for publication: Spanners in randomly weighted graphs: independent edge lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065765)