A distance estimator for a graph property 𝒫 is an algorithm that
given G...
Since computing most variants of the subgraph counting problem in genera...
We consider the problem of counting the number of copies of a fixed grap...
We show that if the degree sequence of a graph G is close in
ℓ_1-distanc...
Property testers are fast randomized algorithms whose task is to disting...
Semi-random processes involve an adaptive decision-maker, whose goal is ...
The area of graph property testing seeks to understand the relation betw...
The minrank of a graph G on the set of vertices [n] over a field
F is th...
The investigation of conditions guaranteeing the appearance of cycles of...