The following pages link to (Q3549723):
Displaying 19 items.
- Matchings on infinite graphs (Q377529) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Testing \(k\)-edge-connectivity of digraphs (Q469635) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- Limits of random trees. II (Q2341945) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Parameter testing in bounded degree graphs of subexponential growth (Q3055893) (← links)
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- The Program of the Mini-Workshop (Q4933360) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Sublinear Graph Approximation Algorithms (Q4933367) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error (Q5002727) (← links)
- (Q5743463) (← 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)
