Pages that link to "Item:Q3654386"
From MaRDI portal
The following pages link to Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs (Q3654386):
Displaying 18 items.
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- Parameter testing in bounded degree graphs of subexponential growth (Q3055893) (← links)
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) (← 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)
- Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Sublinear Graph Approximation Algorithms (Q4933367) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- (Q5002650) (← links)
- (Q5002727) (← links)
- (Q5090414) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- (Q5743463) (← links)
- (Q6084359) (← 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)
