The following pages link to Testing the diameter of graphs (Q4543626):
Displayed 15 items.
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← 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)
- 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)
- 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)
- On Approximating the Number of Relevant Variables in a Function (Q5894227) (← links)