On testable properties in bounded degree graphs
From MaRDI portal
Recommendations
Cited in
(25)- Comparing the strength of query types in property testing: the case of \(k\)-colorability
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
- Testing for edge terms is decidable
- Property testing on \(k\)-vertex-connectivity of graphs
- Every property of hyperfinite graphs is testable
- Quantum property testing for bounded-degree graphs
- Inflatable graph properties and natural property tests
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
- scientific article; zbMATH DE number 1775414 (Why is no real title available?)
- scientific article; zbMATH DE number 6846422 (Why is no real title available?)
- Testing \(k\)-edge-connectivity of digraphs
- Testing Expansion in Bounded-Degree Graphs
- Testing outerplanarity of bounded degree graphs
- A two-sided error distributed property tester for conductance
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
- Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks
- Tight bounds for the cover time of multiple random walks
- Every property of hyperfinite graphs is testable
- Testing subdivision-freeness: property testing meets structural graph theory
- Rumor spreading and vertex expansion
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Orion: zero knowledge proof with linear prover time
- Every minor-closed property of sparse graphs is testable
- Testing the expansion of a graph
This page was built for publication: On testable properties in bounded degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934631)
