Pages that link to "Item:Q5957578"
From MaRDI portal
The following pages link to Property testing in bounded degree graphs (Q5957578):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Spanders: distributed spanning expanders (Q395654) (← links)
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Testing \(k\)-edge-connectivity of digraphs (Q469635) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Testing the expansion of a graph (Q963057) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- The Bradley-Terry condition is \(L_1\)-testable (Q1699573) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Testing metric properties (Q1877548) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- On the strength of comparisons in property testing (Q1887149) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- Planarity can be verified by an approximate proof labeling scheme in constant-time (Q2154327) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Estimating the number of connected components in sublinear time (Q2252647) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Infinite dimensional representations of finite dimensional algebras and amenability (Q2405948) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Two-sided error proximity oblivious testing (Q2795747) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) (← links)
- On the Average-Case Complexity of Property Testing (Q3088183) (← links)
- A Brief Introduction to Property Testing (Q3088197) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← 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)
