Parameter testing with bounded degree graphs of subexponential growth
Combinatorics
2009-07-02 v3 Mathematical Physics
math.MP
Abstract
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.
Cite
@article{arxiv.0711.2800,
title = {Parameter testing with bounded degree graphs of subexponential growth},
author = {Gabor Elek},
journal= {arXiv preprint arXiv:0711.2800},
year = {2009}
}
Comments
To appear in Random Structures and Algorithms. (note that the title has changed)