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 条

[21] On invariants of hereditary graph properties
Mihok, Peter
Semanisin, Gabriel
DISCRETE MATHEMATICS, 2007, 307 (7-8) : 958 - 963
[22] The complexity of obtaining a distance-balanced graph
Cabello, Sergio
Luksic, Primoz
ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
[23] The quantum query complexity of algebraic properties
Doern, Sebastian
Thierauf, Thomas
FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2007, 4639 : 250 - +
[24] Complexity of the List Homomorphism Problem in Hereditary Graph Classes
Okrasa, Karolina
Rzazewski, Pawel
38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
[25] Some graph problems with equivalent lower bounds for query complexity
Láce, L
Praude, R
Freivalds, R
FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE, 2005, : 80 - 86
[26] On the data complexity of consistent query answering over graph databases
Barcelo, Pablo
Fontaine, Gaelle
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 88 : 164 - 194
[27] Complexity of Distance Fraud Attacks in Graph-Based Distance Bounding
Trujillo-Rasua, Rolando
MOBILE AND UBIQUITOUS SYSTEMS: COMPUTING, NETWORKING, AND SERVICES, 2014, 131 : 289 - 302
[28] THE CRITICAL COMPLEXITY OF GRAPH PROPERTIES
TURAN, G
INFORMATION PROCESSING LETTERS, 1984, 18 (03) : 151 - 153
[29] Estimating Product Evolution Graph using Kolmogorov Complexity
Hayase, Yasuhiro
Kanda, Tetsuya
Ishio, Takashi
14TH INTERNATIONAL WORKSHOP ON PRINCIPLES OF SOFTWARE EVOLUTION (IWPSE 2015), 2015, : 66 - 72
[30] A note on the speed of hereditary graph properties
Lozin, Vadim V.
Mayhill, Colin
Zamaraev, Victor
ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):

← 1 2 3 4 5 →