ON THE QUERY COMPLEXITY OF ESTIMATING THE DISTANCE TO HEREDITARY GRAPH PROPERTIES

被引：2

作者：

Hoppen, Carlos ^{[1
]}

Kohayakawa, Yoshiharu ^{[2
]}

Lang, Richard ^{[3
]}

Lefmann, Hanno ^{[4
]}

Stagni, Henrique ^{[2
]}

机构：

[1] Univ Fed Rio Grande do Sul, Inst Matemat & Estat, Ave Bento Goncalves 9500, BR-91501970 Porto Alegre, RS, Brazil

[2] Univ Sao Paulo, Inst Matemat & Estat, Rua Matao 1010, BR-05508090 Sao Paulo, Brazil

[3] Heidelberg Univ, Inst Informat, Neuenheimer Feld 205, D-69120 Heidelberg, Germany

[4] Tech Univ Chemnitz, Fak Informat, Str Nationen 62, D-09111 Chemnitz, Germany

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2021年 / 35卷 / 02期

基金：

巴西圣保罗研究基金会;

关键词：

parameter testing; edit distance; hereditary properties; removal lemma; Frieze-Kannan regularity; REMOVAL; APPROXIMATION;

D O I：

10.1137/19M1283951

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a family of graphs F, we prove that the normalized edit distance of any given graph Gamma to being induced 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 F.

引用

页码：1238 / 1251

页数：14

共 50 条

[41] On the recognition complexity of some graph properties
Triesch, E
COMBINATORICA, 1996, 16 (02) : 259 - 268
[42] On the sensitivity complexity of bipartite graph properties
Gao, Yihan
Mao, Jieming
Sun, Xiaoming
Zuo, Song
THEORETICAL COMPUTER SCIENCE, 2013, 468 : 83 - 91
[43] Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
Rucklidge, WJ
DISCRETE & COMPUTATIONAL GEOMETRY, 1996, 16 (02) : 135 - 153
[44] Parameterized complexity of finding subgraphs with hereditary properties
Khot, S
Raman, V
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 137 - 147
[45] Parameterized complexity of finding subgraphs with hereditary properties
Khot, S
Raman, V
THEORETICAL COMPUTER SCIENCE, 2002, 289 (02) : 997 - 1008
[46] Reciprocal degree distance and graph properties
An, Mingqiang
Zhang, Yinan
Das, Kinkar Ch.
Xiong, Liming
DISCRETE APPLIED MATHEMATICS, 2019, 258 : 1 - 7
[47] Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Stacey Jeffery
Robin Kothari
François Le Gall
Frédéric Magniez
Algorithmica, 2016, 76 : 1 - 16
[48] Estimating distance gradients for apartment properties
Söderberg, B
Janssen, C
URBAN STUDIES, 2001, 38 (01) : 61 - 79
[49] Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Jeffery, Stacey
Kothari, Robin
Le Gall, Francois
Magniez, Frederic
ALGORITHMICA, 2016, 76 (01) : 1 - 16
[50] A jump to the bell number for hereditary graph properties
Balogh, J
Bollobás, B
Weinreich, D
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (01) : 29 - 48

← 1 2 3 4 5 →