scientific article; zbMATH DE number 7375979
From MaRDI portal
Publication:5002727
DOI10.4230/LIPIcs.ICALP.2018.52zbMath1499.68389arXiv1707.06126MaRDI QIDQ5002727
Reut Levi, Hendrik Fichtenberger, Yadu Vasudev, Maximilian Wötzel
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1707.06126
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Randomized algorithms (68W20)
Related Items (4)
Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs ⋮ Property testing of planarity in the \textsf{CONGEST} model ⋮ Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on 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
Cites Work
- Unnamed Item
- Testing outerplanarity of bounded degree graphs
- Graph minors. XX: Wagner's conjecture
- A sublinear bipartiteness tester for bounded degree graphs
- Über eine Eigenschaft der ebenen Komplexe
- Finding cycles and trees in sublinear time
- Property testing and its connection to learning and approximation
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
- On Linear Time Minor Tests with Depth-First Search
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
- Introduction to Testing Graph Properties
- A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
- Local Graph Partitions for Approximation and Testing
- Introduction to Property Testing
- Property testing in bounded degree graphs
This page was built for publication:
