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 条

[31] Estimating graph distance and centrality on shared nothing architectures
Balkir, Atilla Soner
Oktay, Huseyin
Foster, Ian
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2015, 27 (14): : 3587 - 3613
[32] The Query Complexity of Graph Isomorphism: Bypassing Distribution Testing Lower Bounds
Onak, Krzysztof
Sun, Xiaorui
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 165 - 171
[33] Computing a metric basis of a bipartite distance-hereditary graph
Moscarini, Marina
THEORETICAL COMPUTER SCIENCE, 2022, 900 : 20 - 24
[34] Graph classes between parity and distance-hereditary graphs
Cicerone, S
Di Stefano, G
DISCRETE APPLIED MATHEMATICS, 1999, 95 (1-3) : 197 - 216
[35] Exact Distance Query in Large Graphs through Fast Graph Simplification
Liu, Jun
Pan, Yicheng
Hu, Qifu
COMPUTER JOURNAL, 2021, 64 (01): : 93 - 107
[36] Distance-Join: Pattern Match Query In a Large Graph Database
Zou, Lei
Chen, Lei
Oezsu, M. Tamer
PROCEEDINGS OF THE VLDB ENDOWMENT, 2009, 2 (01): : 886 - 897
[37] Distance-Query-Oriented Attribute Weighted Graph Aggregation Algorithm
Ma H.-F.
Bing R.
Zhao W.-Z.
Chang L.
Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2021, 49 (01): : 132 - 139
[38] Lightweight preprocessing and fast query of geodesic distance via proximity graph
Xin, Shiqing
Wang, Wenping
He, Ying
Zhou, Yuanfeng
Chen, Shuangmin
Tu, Changhe
Shu, Zhenyu
COMPUTER-AIDED DESIGN, 2018, 102 : 128 - 138
[39] DECISION TREE COMPLEXITY OF GRAPH PROPERTIES
Gao Suixiang (Mathematics Department
中国科学院大学学报, 1999, (02) : 95 - 99
[40] On the recognition complexity of some graph properties
Triesch, E
COMBINATORICA, 1996, 16 (02) : 259 - 268

← 1 2 3 4 5 →