We give an algorithm solving this optimization problem on any $n$-vertex graph $G$ in time ${\cal O}(|\Pi_G| \cdot n^{t+4}\cdot f(t,\varphi))$, where $\varphi$ is a counting monadic second order logic formula and $t\geq 0$ be an integer.Expand

We show that, for every connected 4-node graph H, testing whether a graph is H-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free.Expand

In this paper we present distributed property-testing algorithms for graph properties in the CONGEST model, with emphasis on testing subgraph-freeness.Expand