P
Initializing...
Theorem 3.31 — $k$-PLDD in decremental graphs: path-reporting, approximation $\tilde O(k)$, time $O((n+m^{1+o(1)})k)$ · Prove2Me