Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Some APX-completeness results for cubic graphs
Theoretical Computer Science
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Limits of dense graph sequences
Journal of Combinatorial Theory Series B
Testing versus Estimation of Graph Properties
SIAM Journal on Computing
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Note on limits of finite graphs
Combinatorica
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
Sublinear graph approximation algorithms
Property testing
Sublinear graph approximation algorithms
Property testing
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
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
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 |
Parameter testing algorithms are using constant number of queries to estimate the value of a certain parameter of a very large finite graph. It is well-known that graph parameters such as the independence ratio or the edit-distance from 3-colorability are not testable in bounded degree graphs. We prove, however, that these and several other interesting graph parameters are testable in bounded degree graphs of subexponential growth. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010