The following pages link to Efficient testing of large graphs (Q5932749):
Displaying 50 items.
- 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)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Every Monotone 3-Graph Property is Testable (Q3439395) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (Q3507528) (← links)
- (Q3574356) (← links)
- Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
- A sparse regular approximation lemma (Q4633762) (← links)
- Testing graphs for colorability properties* (Q4680410) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284) (← links)
- A unified framework for testing linear‐invariant properties (Q4982614) (← links)
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
- Estimating parameters associated with monotone properties (Q4993108) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q4993262) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- Efficient Removal Lemmas for Matrices (Q5002628) (← links)
- (Q5009551) (← links)
- Polynomial removal lemmas for ordered graphs (Q5051460) (← links)
- On the Interplay Between Strong Regularity and Graph Densification (Q5082152) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- Testing Linear-Invariant Properties (Q5096106) (← links)
- Flexible Models for Testing Graph Properties (Q5098784) (← links)
- Seeding with Costly Network Information (Q5106371) (← links)
- Popular progression differences in vector spaces II (Q5211015) (← links)
- Minimizing the number of 5-cycles in graphs with given edge-density (Q5222570) (← links)
- The Induced Removal Lemma in Sparse Graphs (Q5222577) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)
- Universality of Graphs with Few Triangles and Anti-Triangles (Q5366905) (← links)
- Non-Deterministic Graph Property Testing (Q5397730) (← links)
- Minimum Number of<i>k</i>-Cliques in Graphs with Bounded Independence Number (Q5397739) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- (Q5743465) (← links)
- Large Book-Cycle Ramsey Numbers (Q5857008) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- (Q5875525) (← links)
- Structured Codes of Graphs (Q5883294) (← links)
- Regularity lemmas in a Banach space setting (Q5890899) (← links)
- Testing Graph Blow-Up (Q5894224) (← links)
- Testing Graph Blow-Up (Q5894229) (← links)
