A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
[article]
2020
arXiv
pre-print
We give the first non-trivial fully dynamic probabilistic tree embedding algorithm for weighted graphs undergoing edge insertions and deletions. We obtain a trade-off between amortized update time and expected stretch against an oblivious adversary. At the two extremes of this trade-off, we can maintain a tree of expected stretch O (log^4 n) with update time m^1/2 + o(1) or a tree of expected stretch n^o(1) with update time n^o(1) (for edge weights polynomial in n). A guarantee of the latter
arXiv:2004.10319v2
fatcat:uevdd7dx75avpbtivcc4oh5j34