The following pages link to Efficient testing of large graphs (Q5932749):
Displaying 50 items.
- Approximate consistency for transformations on words and trees (Q264563) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Deterministic vs non-deterministic graph property testing (Q480810) (← links)
- Extrema of graph eigenvalues (Q492762) (← links)
- Testing permutation properties through subpermutations (Q551179) (← links)
- On the density of a graph and its blowup (Q602726) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Limits of kernel operators and the spectral regularity lemma (Q648972) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- The number of graphs with large forbidden subgraphs (Q710718) (← links)
- Sublinear time algorithms in the theory of groups and semigroups. (Q716397) (← links)
- Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Generalizations of the removal lemma (Q987562) (← links)
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- On the strength of comparisons in property testing (Q1887149) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- A characterization of easily testable induced digraphs and \(k\)-colored graphs (Q2136197) (← links)
- Induced arithmetic removal: complexity 1 patterns over finite fields (Q2142699) (← links)
- The edit distance function of some graphs (Q2175239) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- Hyperfinite graphings and combinatorial optimization (Q2220974) (← links)
- Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits (Q2312609) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- The removal lemma for tournaments (Q2421551) (← links)
- Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Two-sided error proximity oblivious testing (Q2795747) (← links)
- (Q2857341) (← links)
- Perfect Graphs of Fixed Density: Counting and Homogeneous Sets (Q2911067) (← links)
- Testability and repair of hereditary hypergraph properties (Q3057063) (← links)
- Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
