Random Walks and Forbidden Minors I: An n^{1/2+o(1)}-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
From MaRDI portal
Publication:6139828
Cites work
- scientific article; zbMATH DE number 1380616 (Why is no real title available?)
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
- A sublinear bipartiteness tester for bounded degree graphs
- A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error
- An efficient partitioning oracle for bounded-treewidth graphs
- An expansion tester for bounded degree graphs
- Efficient Planarity Testing
- Every minor-closed property of sparse graphs is testable
- Finding cycles and trees in sublinear time
- Graph minor theory
- Graph minors. XX: Wagner's conjecture
- Graph theory
- Introduction to Property Testing
- Local Graph Partitions for Approximation and Testing
- Noise tolerance of expanders and sublinear expansion reconstruction
- On testing expansion in bounded-degree graphs
- Property testing in bounded degree graphs
- Random walks and forbidden minors. I: An \(n^{1/2+o(1)}\)-query one-sided tester for minor closed properties on bounded degree graphs
- Subexponential algorithms for unique games and related problems
- Testing Expansion in Bounded-Degree Graphs
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
- Testing cluster structure of graphs
- Testing outerplanarity of bounded degree graphs
- Testing the expansion of a graph
- The disjoint paths problem in quadratic time
This page was built for publication: Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139828)
