A combinatorial characterization of the testable graph properties: it s all about regularity

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]

Abstract

Abstract is missing.