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 条

[1] Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
Eppstein, David
Gupta, Siddharth
Havvaei, Elham
FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 217 - 229
[2] The maximum edit distance from hereditary graph properties
Alon, Noga
Stav, Uri
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2008, 98 (04) : 672 - 697
[3] QUANTUM QUERY COMPLEXITY OF MINOR-CLOSED GRAPH PROPERTIES
Childs, Andrew M.
Kothari, Robin
SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1426 - 1450
[4] Quantum query complexity of minor-closed graph properties
Childs, Andrew M.
Kothari, Robin
28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 661 - 672
[5] On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
Firbas, Alexander
Sorge, Manuel
Leibniz International Proceedings in Informatics, LIPIcs, 322
[6] The query complexity of estimating weighted averages
Amit Chakrabarti
Venkatesan Guruswami
Andrew Wirth
Anthony Wirth
Acta Informatica, 2011, 48 : 417 - 426
[7] The query complexity of estimating weighted averages
Chakrabarti, Amit
Guruswami, Venkatesan
Wirth, Andrew
Wirth, Anthony
ACTA INFORMATICA, 2011, 48 (7-8) : 417 - 426
[8] Quantum query complexity for some graph problems
Berzina, A
Dubrovsky, A
Freivalds, R
Lace, L
Scegulnaja, O
SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 140 - 150
[9] Quantum query complexity of some graph problems
Dürr, C
Heiligman, M
Hoyer, P
Mhalla, M
SIAM JOURNAL ON COMPUTING, 2006, 35 (06) : 1310 - 1328
[10] Quantum query complexity of some graph problems
Dürr, C
Heiligman, M
Hoyer, P
Mhalla, M
AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 481 - 493

← 1 2 3 4 5 →