Every minor-closed property of sparse graphs is testable-Reference-Cited by-同舟云学术

Every minor-closed property of sparse graphs is testable

Published:2008-05-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the fortieth annual ACM symposium on Theory of computing
language:
Short-container-title:

Author:

Benjamini Itai¹,Schramm Oded¹,Shapira Asaf¹

Affiliation:

1. Microsoft Research, Redmond, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/1374376.1374433

Reference42 articles.

1. A combinatorial characterization of the testable graph properties

2. A separator theorem for nonplanar graphs

3. A Characterization of the (natural) Graph Properties Testable with One-Sided Error

4. N. Alon and A. Shapira A separation theorem in property testing Combinatorica to appear. 10.1007/s00493-008-2321-1 N. Alon and A. Shapira A separation theorem in property testing Combinatorica to appear. 10.1007/s00493-008-2321-1

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pliability and Approximating Max-CSPs;Journal of the ACM;2023-11-30

2. A Lower Bound on Cycle-Finding in Sparse Digraphs;ACM Transactions on Algorithms;2022-10-10

3. Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs;SIAM Journal on Computing;2022-08-16

4. Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. Property testing of planarity in the CONGEST model;Distributed Computing;2020-07-13