P
Initializing...
Theorem 10.7 — decremental tree cover: $O(\log n\log(Ln))$ dominating tree embeddings with stretch $\tilde O(\log L)$, time $O((m+n)^{1+o(1)}\mathrm{polylog}(L))$ (corrected: degenerate logarithms) · Prove2Me