Pages that link to "Item:Q4651520"
From MaRDI portal
The following pages link to Tight Bounds for Testing Bipartiteness in General Graphs (Q4651520):
Displayed 28 items.
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← 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)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← 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)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← 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)
- (Q5009503) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- (Q5090414) (← links)
- (Q5090437) (← links)
- Quantum Chebyshev's Inequality and Applications (Q5091227) (← 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)
- (Q5743465) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs (Q6051991) (← links)
- (Q6084359) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)