Finding cycles and trees in sublinear time-Reference-Cited by-同舟云学术

Finding cycles and trees in sublinear time

Published:2012-08-22 Issue:2 Volume:45 Page:139-184
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Czumaj Artur¹,Goldreich Oded²,Ron Dana³,Seshadhri C.⁴,Shapira Asaf⁵,Sohler Christian⁶

Affiliation:

1. Department of Computer Science, Centre for Discrete Mathematics and its Applications (DIMAP); University of Warwick; Coventry United Kingdom

2. Department of Computer Science; Weizmann Institute of Science; Rehovot Israel

3. School of Electrical Engineering, Tel Aviv University; Tel Aviv 69978 Israel

4. Sandia National Laboratories; Livermore California

5. School of Mathematics, Tel-Aviv University, Tel-Aviv, Israel, and Schools of Mathematics and Computer Science, Georgia Institute of Technology; Atlanta GA 30332 USA

6. Department of Computer Science; TU Dortmund University; Dortmund Germany

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference22 articles.

1. Testing satisfiability;Alon;J Algorithms,2003

2. On the girth of Hamiltonian weakly pancyclic graphs;Bollobás;J Graph Theory,1997

3. A. Czumaj O. Goldreich D. Ron C. Seshadhri A. Shapira C. Sohler Finding cycles and trees in sublinear time, Technical report 2010

4. The art of uninformed decisions: A primer to property testing;Fischer;Bull Eur Assoc Theor Comput Sci,2001

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

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

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

3. Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs;SIAM Journal on Computing;2022-08-16

4. Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. Testing stability properties in graphical hedonic games;Autonomous Agents and Multi-Agent Systems;2021-06-07