Spanners in randomly weighted graphs: independent edge lengths

From MaRDI portal
Publication:2065765




Abstract: Given a connected graph G=(V,E) and a length function ell:EomathbbR we let dv,w denote the shortest distance between vertex v and vertex w. A t-spanner is a subset EsubseteqE such that if d'v,w denotes shortest distances in the subgraph G=(V,E) then d'v,wleqtdv,w for all v,winV. 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 approxfrac12nlogn edges and that this is best possible. In particular, our result applies to the random graphs Gn,p for npgglogn.









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)