P
Initializing...
Theorem 3.27 — MaintainCluster in decremental graphs: bit $g_B$ with a far pair, paths of length $2^{1/\mathrm{poly}(\epsilon)}D$ in $G$, time $O(n+m^{1+O(\epsilon)}2^{O(1/\mathrm{poly}(\epsilon))})$ · Prove2Me