Testing outerplanarity of bounded degree graphs
From MaRDI portal
Recommendations
- Testing outerplanarity of bounded degree graphs
- On testable properties in bounded degree graphs
- Property testing in bounded degree graphs
- scientific article; zbMATH DE number 1559556
- On testing expansion in bounded-degree graphs
- Testing Expansion in Bounded-Degree Graphs
- An expansion tester for bounded degree graphs
- An Expansion Tester for Bounded Degree Graphs
- Orthogonal planarity testing of bounded treewidth graphs
- Testing Planarity of Partially Embedded Graphs
Cites work
- scientific article; zbMATH DE number 1003278 (Why is no real title available?)
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- A Separator Theorem for Nonplanar Graphs
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- A sublinear bipartiteness tester for bounded degree graphs
- An efficient partitioning oracle for bounded-treewidth graphs
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Every minor-closed property of sparse graphs is testable
- Graph minor theory
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Local Graph Partitions for Approximation and Testing
- On testable properties in bounded degree graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Property testing on \(k\)-vertex-connectivity of graphs
- Property testing. Current research and surveys
- Robust Characterizations of Polynomials with Applications to Program Testing
- Sublinear time algorithms
- Testing the diameter of graphs
- The complexity of some edge deletion problems
Cited in
(9)- Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs
- Orthogonal planarity testing of bounded treewidth graphs
- A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error
- Random walks and forbidden minors. I: An \(n^{1/2+o(1)}\)-query one-sided tester for minor closed properties on bounded degree graphs
- Property testing of planarity in the \textsf{CONGEST} model
- Every property of outerplanar graphs is testable
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
- Testing outerplanarity of bounded degree graphs
- Direct solvers for the biharmonic eigenvalue problems using Legendre polynomials
This page was built for publication: Testing outerplanarity of bounded degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494925)