Introduction to Testing Graph Properties (Q4933365): Difference between revisions

@@ Property / cites work @@
+Testing subgraphs in large graphs
@@ Property / cites work: Testing subgraphs in large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient testing of large graphs
@@ Property / cites work: Efficient testing of large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial characterization of the testable graph properties
+Normal rank
@@ Property / cites work @@
+Testing <i>k</i>-colorability
@@ Property / cites work: Testing <i>k</i>-colorability / rank @@
+Normal rank
@@ Property / cites work @@
+Testing triangle-freeness in general graphs
@@ Property / cites work: Testing triangle-freeness in general graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Testing subgraphs in directed graphs
@@ Property / cites work: Testing subgraphs in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Every monotone graph property is testable
@@ Property / cites work: Every monotone graph property is testable / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501357
@@ Property / cites work: Q5501357 / rank @@
+Normal rank
@@ Property / cites work @@
+A separation theorem in property testing
@@ Property / cites work: A separation theorem in property testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Q4252728
@@ Property / cites work: Q4252728 / rank @@
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+Testing properties of directed graphs: acyclicity and connectivity*
+Normal rank
@@ Property / cites work @@
+Q3579435
@@ Property / cites work: Q3579435 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549723
@@ Property / cites work: Q3549723 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+Lower bounds for sampling algorithms for estimating the average
+Normal rank
@@ Property / cites work @@
+Q4535797
@@ Property / cites work: Q4535797 / rank @@
+Normal rank
@@ Property / cites work @@
+MAX-CUT has a randomized approximation scheme in dense graphs
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+Testing graph isomorphism
@@ Property / cites work: Testing graph isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Hypergraph Partitioning and Applications
+Normal rank
@@ Property / cites work @@
+Testing versus estimation of graph properties
@@ Property / cites work: Testing versus estimation of graph properties / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Introduction to Testing Graph Properties
@@ Property / cites work: Introduction to Testing Graph Properties / rank @@
+Normal rank
@@ Property / cites work @@
+Property testing in bounded degree graphs
@@ Property / cites work: Property testing in bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sublinear bipartiteness tester for bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Approximating average parameters of graphs
@@ Property / cites work: Approximating average parameters of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three theorems regarding testing graph properties
@@ Property / cites work: Three theorems regarding testing graph properties / rank @@
+Normal rank
@@ Property / cites work @@
+On the Benefits of Adaptivity in Property Testing of Dense Graphs
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Local Graph Partitions for Approximation and Testing
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+An Expansion Tester for Bounded Degree Graphs
@@ Property / cites work: An Expansion Tester for Bounded Degree Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Testing Bipartiteness in General Graphs
+Normal rank
@@ Property / cites work @@
+Distance Approximation in Bounded-Degree and General Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Testing the expansion of a graph
@@ Property / cites work: Testing the expansion of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Testing the diameter of graphs
@@ Property / cites work: Testing the diameter of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tolerant property testing and distance approximation
+Normal rank
@@ Property / cites work @@
+lgorithmic and Analysis Techniques in Property Testing
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank