Testing versus estimation of graph properties, revisited

Lior Gishboliner, Nick Kushnir, Asaf Shapira

A distance estimator for a graph property $\mathcal{P}$ is an algorithm that given $G$ and $\alpha ,\epsilon >0$ distinguishes between the case that $G$ is $(\alpha -\epsilon )$-close to…