Ilan Newman, Christian Sohler. Every property of hyperfinite graphs is testable. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 675-684, ACM, 2011. [doi]
@inproceedings{NewmanS11,
title = {Every property of hyperfinite graphs is testable},
author = {Ilan Newman and Christian Sohler},
year = {2011},
doi = {10.1145/1993636.1993726},
url = {http://doi.acm.org/10.1145/1993636.1993726},
tags = {testing, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/NewmanS11},
cites = {0},
citedby = {0},
pages = {675-684},
booktitle = {Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011},
editor = {Lance Fortnow and Salil P. Vadhan},
publisher = {ACM},
isbn = {978-1-4503-0691-1},
}