Random walks and forbidden minors II

DOI10.1145/3313276.3316330zbMath1433.68300arXiv1904.01055OpenAlexW2942215842MaRDI QIDQ5212798

Akash Kumar, C. Seshadhri, Andrew M. Stolman

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.01055

zbMATH Keywords

property testinggraph minorsbounded-degree graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Randomized algorithms (68W20) Random walks on graphs (05C81)

Related Items (5)

Property testing of planarity in the \textsf{CONGEST} model ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ On the tree-width of even-hole-free 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 ⋮ An explicit construction of graphs of bounded degree that are far from being Hamiltonian

This page was built for publication: Random walks and forbidden minors II