The following pages link to (Q5501357):
Displaying 29 items.
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Colorings with only rainbow arithmetic progressions (Q2220973) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Fast Property Testing and Metrics for Permutations (Q3177362) (← links)
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (Q3507528) (← links)
- Testing subgraphs in large graphs (Q4798173) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- (Q5009551) (← links)
- Polynomial removal lemmas for ordered graphs (Q5051460) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- Testing Graph Blow-Up (Q5894224) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894226) (← links)
- Testing Graph Blow-Up (Q5894229) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894230) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)
- Testing linear inequalities of subgraph statistics (Q6049999) (← links)
