Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference15 articles.
1. Alon, N.: Testing subgraphs of large graphs. Random Structures and Algorithms, Vol. 21, 359–370 (2002)
2. N. Alon, E. Fischer, I. Newman, and A. Shapira. A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. In 38th STOC, pages 251–260, 2006
3. Alon, N., Shapira, A.: Testing subgraphs in directed graphs. JCSS, Vol. 69, 354–482 (2004)
4. Alon, N., Shapira, A.: Every Monotone Graph Property is Testable. SIAM Journal on Computing, Vol. 38, 505–522 (2008)
5. I. Benjamini, O. Schramm, and A. Shapira. Every Minor-Closed Property of Sparse Graphs is Testable. In 40th STOC, pages 393–402, 2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
2. Flexible Models for Testing Graph Properties;Lecture Notes in Computer Science;2020