Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira. A combinatorial characterization of the testable graph properties: it s all about regularity. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 251-260, ACM, 2006. [doi]
@inproceedings{Shapira06,
title = {A combinatorial characterization of the testable graph properties: it s all about regularity},
author = {Noga Alon and Eldar Fischer and Ilan Newman and Asaf Shapira},
year = {2006},
doi = {10.1145/1132516.1132555},
url = {http://doi.acm.org/10.1145/1132516.1132555},
tags = {testing, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Shapira06},
cites = {0},
citedby = {0},
pages = {251-260},
booktitle = {Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006},
editor = {Jon M. Kleinberg},
publisher = {ACM},
isbn = {1-59593-134-1},
}