N. Alon and A. Shapira. Testing subgraph in directed graphs. In Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, pages 700-709, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Characterization of Easily Testable Induced Subgraphs - Alon, Shapira (2004) Self-citation (Alon Shapira) (Correct)
No context found.
N. Alon and A. Shapira, Testing subgraphs in directed graphs, Proc. of the 35 Annual Symp. on Theory of Computing (STOC), San Diego, California, 2003, 700--709.
Turán numbers of bipartite graphs and related.. - Alon, Krivelevich.. Self-citation (Alon) (Correct)
No context found.
N. Alon and A. Shapira, Testing subgraphs in directed graphs, Proc. of the 35 th ACM STOC, ACM Press (2003), in press.
Testing Satisfiability - Alon, Shapira (2003) (2 citations) Self-citation (Alon Shapira) (Correct)
....there is a one sided error property tester for K t,t freeness that queries only O(1 # ) vertices. This follows from the fact that any graph with at least #n edges contains at least #(# ) copies of K t,t . In fact, sampling 1 # O(t) vertices su#ces, by a special case of a 8 result in [5] improving the estimate in [1] It is also worth noting that there are simple graph properties (like the property of containing at least n 4 edges) that have two sided error testers of complexity polynomial in 1 #, but no one sided error tester of complexity smaller that #(n) The claims above ....
N. Alon and A. Shapira, Testing subgraphs in directed graphs, Proc. of the 35 ACM STOC, ACM Press (2003), to appear.
Tight Bounds for Testing Bipartiteness in General Graphs - Kaufman, Krivelevich, Ron (2004) (Correct)
No context found.
N. Alon and A. Shapira. Testing subgraph in directed graphs. In Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, pages 700-709, 2003.
Tight Bounds for Testing Bipartiteness in General Graphs - Kaufman, Krivelevich, Ron (2003) (Correct)
No context found.
N. Alon and A. Shapira. Testing subgraph in directed graphs. Submitted, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC