Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Parameter testing in bounded degree graphs of subexponential growth
Random Structures & Algorithms
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Local graph exploration and fast property testing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Property testing
Sublinear graph approximation algorithms
Property testing
Property testing
Property testing
Sublinear graph approximation algorithms
Property testing
Property testing
Every property of hyperfinite graphs is testable
Proceedings of the forty-third annual ACM symposium on Theory of computing
An efficient partitioning oracle for bounded-treewidth graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
An Expansion Tester for Bounded Degree Graphs
SIAM Journal on Computing
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SIAM Journal on Discrete Mathematics
Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A quasi-polynomial time partition oracle for graphs with an excluded minor
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is well known that in the bounded-degree graph model (where two graphs are considered “far” if they differ in $\varepsilon n$ edges for a positive constant $\varepsilon$), many graph properties cannot be tested even with a constant or even with a polylogarithmic number of queries. Therefore in this paper we focus our attention on testing graph properties for special classes of graphs. Specifically, we show that every hereditary graph property is testable with a constant number of queries provided that every sufficiently large induced subgraph of the input graph has poor expansion. This result implies that, for example, any hereditary property (e.g., $k$-colorability, $H$-freeness, etc.) is testable in the bounded-degree graph model for planar graphs, graphs with bounded genus, interval graphs, etc. No such results have been known before, and prior to our work, very few graph properties have been known to be testable with a constant number of queries for general graph classes in the bounded-degree graph model.