Pages that link to "Item:Q5957578"
From MaRDI portal
The following pages link to Property testing in bounded degree graphs (Q5957578):
Displaying 47 items.
- Property testing and its connection to learning and approximation (Q3158518) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs (Q3654386) (← links)
- Three theorems regarding testing graph properties (Q4417002) (← links)
- Testing the diameter of graphs (Q4543626) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- (Q4606322) (← links)
- Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- TESTING FOR FORBIDDEN POSETS IN ORDERED ROOTED FORESTS (Q4923287) (← links)
- A Brief Introduction to Property Testing (Q4933359) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Sublinear Graph Approximation Algorithms (Q4933367) (← links)
- Invariance in Property Testing (Q4933370) (← 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)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error (Q5002727) (← links)
- (Q5009503) (← links)
- (Q5075742) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- (Q5090414) (← links)
- On the Effect of the Proximity Parameter on Property Testers (Q5098769) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Flexible Models for Testing Graph Properties (Q5098784) (← links)
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty (Q5236227) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313042) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- (Q5875525) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs (Q5890147) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894226) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894230) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- (Q6084359) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q6139828) (← links)
- Robustly self-ordered graphs: constructions and applications to property testing (Q6562699) (← links)
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing (Q6573776) (← links)
- Testing connectedness of images (Q6623596) (← links)
