Random walks and forbidden minors II-Reference-Cited by-同舟云学术

Random walks and forbidden minors II

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019
language:
Short-container-title:

Author:

Kumar Akash¹,Seshadhri C.²,Stolman Andrew²

Affiliation:

1. Purdue University, USA

2. University of California at Santa Cruz, USA

Funder

NSF TRIPODS

NSF

Publisher

ACM Press

Reference29 articles.

1. Noga Alon, Paul Seymour, and Robin Thomas. 1990. A separator theorem for nonplanar graphs. Journal of the American Mathematical Society 3, 4 (1990), 801–808.

2. I. Benjamini, O. Schramm, and A. Shapira. 2008. Every Minor-Closed Property of Sparse Graphs is Testable. In Symposium on the Theory of Computing (STOC). 393–402.

3. Artur Czumaj, Oded Goldreich, Dana Ron, C Seshadhri, Asaf Shapira, and Christian Sohler. 2014. Finding cycles and trees in sublinear time. Random Structures &amp

4. Algorithms 45, 2 (2014), 139–184.

5. Reinhard Diestel. 2010. Graph Theory, Fourth Edition. Springer.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing;SIAM Journal on Computing;2024-07-04

2. Pliability and Approximating Max-CSPs;Journal of the ACM;2023-11-30

3. Testing Cluster Properties of Signed Graphs;Proceedings of the ACM Web Conference 2023;2023-04-30

4. Multiple random walks on graphs: mixing few to cover many;Combinatorics, Probability and Computing;2023-02-15

5. A Lower Bound on Cycle-Finding in Sparse Digraphs;ACM Transactions on Algorithms;2022-10-10