{"publication":"Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)","type":"conference","date_updated":"2022-01-06T06:53:50Z","page":"494-501","language":[{"iso":"eng"}],"date_created":"2020-08-31T07:40:36Z","citation":{"short":"C. Sohler, A. Czumaj, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07), 2007, pp. 494–501.","apa":"Sohler, C., &#38; Czumaj, A. (2007). On Testable Properties in Bounded Degree Graphs. In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i> (pp. 494–501).","chicago":"Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree Graphs.” In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 494–501, 2007.","ama":"Sohler C, Czumaj A. On Testable Properties in Bounded Degree Graphs. In: <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>. ; 2007:494-501.","mla":"Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree Graphs.” <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 2007, pp. 494–501.","bibtex":"@inproceedings{Sohler_Czumaj_2007, title={On Testable Properties in Bounded Degree Graphs}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={494–501} }","ieee":"C. Sohler and A. Czumaj, “On Testable Properties in Bounded Degree Graphs,” in <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 2007, pp. 494–501."},"user_id":"15415","publication_identifier":{"isbn":["9780898716245"]},"department":[{"_id":"63"}],"title":"On Testable Properties in Bounded Degree Graphs","_id":"18655","abstract":[{"text":"We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs. Therefore in this paper we focus our attention on testing graph properties for special classes of graphs. We call a graph family non-expanding if every graph in this family is not a weak expander (its expansion is O(1/log2 n), where n is the graph size). A graph family is hereditary if it is closed under vertex removal. Similarly, a graph property is hereditary if it is closed under vertex removal. Next, we call a graph property Π to be testable for a graph family F if for every graph G ε F, in time independent of the size of G we can distinguish between the case when G satisfies property Π and when it is far from every graph satisfying property Π. In this paper we prove thatIn the bounded degree graph model, any hereditary property is testable if the input graph belongs to a hereditary and non-expanding family of graphs.As an application, our result implies that, for example, any hereditary property (e.g., k-colorability, H-freeness, etc.) is testable in the bounded degree graph model for planar graphs, graphs with bounded genus, interval graphs, etc. No such results have been known before and prior to our work, in the bounded degree graph model very few graph properties have been known to be testable for any graph classes.","lang":"eng"}],"author":[{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"year":"2007","status":"public"}