scientific article; zbMATH DE number 1775414
From MaRDI portal
Publication:4542547
Recommendations
- A sublinear bipartiteness tester for bounded degree graphs
- Tight Bounds for Testing Bipartiteness in General Graphs
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- An efficient algorithm to test potential bipartiteness of graphical degree sequences
- On testable properties in bounded degree graphs
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
- An expansion tester for bounded degree graphs
- An Expansion Tester for Bounded Degree Graphs
- On testing expansion in bounded-degree graphs
Cited in
(16)- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
- Tight Bounds for Testing Bipartiteness in General Graphs
- Property testing in bounded degree graphs
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Testing \(k\)-edge-connectivity of digraphs
- On the Randomness Complexity of Property Testing
- Planar graphs: random walks and bipartiteness testing
- Sublinear graph augmentation for fast query implementation
- On the randomness complexity of property testing
- Testing problems with sublearning sample complexity
- scientific article; zbMATH DE number 1559556 (Why is no real title available?)
- Property testing on \(k\)-vertex-connectivity of graphs
- Property testing and its connection to learning and approximation
- Towards the Erdős-Gallai cycle decomposition conjecture
- A sublinear bipartiteness tester for bounded degree graphs
- An efficient algorithm to test potential bipartiteness of graphical degree sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542547)
