The following pages link to Testing the diameter of graphs (Q4543626):
Displayed 31 items.
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← 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)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← 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 Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- (Q5009503) (← links)
- (Q5090414) (← 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)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- On Sampling Edges Almost Uniformly (Q5240421) (← links)
- On Approximating the Number of Relevant Variables in a Function (Q5894227) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- (Q6084359) (← links)