Testing properties of directed graphs: acyclicity and connectivity-Reference-Cited by-同舟云学术

Testing properties of directed graphs: acyclicity and connectivity

Published:2002-02-07 Issue:2 Volume:20 Page:184-205
ISSN:1042-9832
Container-title:Random Structures and Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Bender Michael A.,Ron Dana

Publisher

Wiley

Subject

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

Reference32 articles.

1. and Efficient testing of large graphs, Proc Fortieth Annual Symposium on Foundations of Computer Science, 1999, pp. 656-666.

2. and Regular languages are testable with a constant number of queries, Proc Fortieth Annual Symposium on Foundations of Computer Science, 1999, pp. 645-655.

3. and A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, Proc. Thirty-Seventh Annual Symposium on Foundations of Computer Science, 1996, pp. 21-30.

4. Proof verification and the hardness of approximation problems

5. Probabilistic checking of proofs

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

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

2. Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

3. On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs;computational complexity;2020-01-20

4. A Direct Proof of Improved Biased Random Walk with Gastric Cancer Dataset;2018 International Conference on Applied Mathematics & Computer Science (ICAMCS);2018-04

5. Fast distributed algorithms for testing graph properties;Distributed Computing;2018-01-18