On the query complexity of estimating the distance to hereditary graph properties

Carlos Hoppen; Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni

On the query complexity of estimating the distance to hereditary graph properties

Combinatorics 2021-02-02 v2 Data Structures and Algorithms

Authors: Carlos Hoppen , Yoshiharu Kohayakawa , Richard Lang , Hanno Lefmann , Henrique Stagni

Abstract

Given a family of graphs $\mathcal{F}$ , we prove that the normalized edit distance of any given graph $\Gamma$ to being induced $\mathcal{F}$ -free is estimable with a query complexity that depends only on the bounds of the Frieze--Kannan Regularity Lemma and on a Removal Lemma for $\mathcal{F}$ .

Keywords

graph properties query complexity edit distance hereditary properties regularity lemma removal lemma

Cite

@article{arxiv.1912.01081,
  title  = {On the query complexity of estimating the distance to hereditary graph properties},
  author = {Carlos Hoppen and Yoshiharu Kohayakawa and Richard Lang and Hanno Lefmann and Henrique Stagni},
  journal= {arXiv preprint arXiv:1912.01081},
  year   = {2021}
}

Comments

To appear in SIDMA

On the query complexity of estimating the distance to hereditary graph properties

Abstract

Keywords

Cite

Comments

Related papers