The following pages link to (Q4542547):
Displaying 12 items.
- Testing \(k\)-edge-connectivity of digraphs (Q469635) (← links)
- On the randomness complexity of property testing (Q623502) (← links)
- Sublinear graph augmentation for fast query implementation (Q1757769) (← links)
- A sublinear bipartiteness tester for bounded degree graphs (Q1964592) (← links)
- Property testing on \(k\)-vertex-connectivity of graphs (Q2428696) (← links)
- Property testing and its connection to learning and approximation (Q3158518) (← links)
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects (Q3603487) (← links)
- An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900945) (← links)
- Testing problems with sublearning sample complexity (Q5929914) (← links)
- Property testing in bounded degree graphs (Q5957578) (← links)