Testing Properties of Directed Graphs: Acyclicity and Connectivity

Random Structures and Algorithms

Volumn 20, Issue 2, 2002, Pages 184-205

  Bender, Michael A ^a   Ron, Dana ^b  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036110133     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10023     Document Type: Article

References (34)

1. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs, Proc Fortieth Annual Symposium on Foundations of Computer Science, 1999, pp. 656-666.
2. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, Regular languages are testable with a constant number of queries, Proc Fortieth Annual Symposium on Foundations of Computer Science, 1999, pp. 645-655.
3. S. Arora, A. Frieze, and H. Kaplan, 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. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, J Assoc Comput Machinery 45(3) (1998), 501-555.
5. S. Arora and S. Safra, Probablistic checkable proofs: A new characterization of NP, J Assoc Comput Machinery 45(1) (1998), 70-122.
6. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in polylogarithmic time, Proc Twenty-Third Annual ACM Symposium on Theory of Computing, 1991, pp. 21-31.
7. L. Babai, L. Fortnow and C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Computat Complexity 1(1) (1991), 3-40.
8. B. Berger and P.W. Shor, Tight bounds for the maximum acyclic subgraph problem, J Alg 25(1) (1997), 1-18.
9. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J Assoc Comput Machinery 47 (1993), 549-595.
10. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky, Improved testing algorithms for monotonicity, Proc RANDOM 99, 1999, pp. 97-108.
11. F. Ergun, S. Kannan, S.R. Kumar, R. Rubinfeld, and M. Viswanathan, Spot-checkers, Proc Thirty-Second Annual ACM Symposium on the Theory of Computing, 1998, pp. 259-268.
12. G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica 20(2) (1998), 151-174.
13. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete, J Assoc Comput Machinery 43(2) (1996), 268-292.
14. A. Frieze and R. Kanan, Quick approximation to matrices and applications, Combinatorica 19(2) (1999), 175-220.
15. P.B. Gibbons and Y. Matias, New sampling-based summary statistics for improving approximate query answers, SIGMOD Record: Proc. ACM SIGMOD Int Conf Management of Data, 2-4 June 1998, Vol. 27, No. 2, pp. 331-342.
16. P.B. Gibbons and Y. Matias, Synopsis data structures for massive data sets, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science: Special Issue on External Memory Algorithms and Visualization, A, 1999.
17. M. Goemans and D. Williamson, Primal-dual approximation algorithms for feedback problems in planar graphs, Combinatorica 18(1) (1998), 37-59.
18. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samordinsky, Testing monotonicity, Combinatorica 20(3) (2000), 301-307.
19. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J Assoc Comput Machinery 45(4) (1998), 653-750, 1998. An extended abstract appeared in FOCS96, pages 339-348.
20. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J Assoc Comput Machinery 45(4) (1998), 653-750, 1998. An extended abstract appeared in FOCS96, pages 339-348.
21. O. Goldreich and D. Ron, Property testing in bounded degree graphs, Algorithmica 32(2) (2002), 302-343. An extended abstract appeared in STOC97, pp. 406-415.
22. O. Goldreich and D. Ron, Property testing in bounded degree graphs, Algorithmica 32(2) (2002), 302-343. An extended abstract appeared in STOC97, pp. 406-415.
23. O. Goldreich and D. Ron, A sublinear bipartite tester for bounded degree graphs, Combinatorica 19(3) (1999), 335-373.
24. R. Hassin and S. Rubinstein, Approximations for the maximum acyclic subgraph problem, Inform Process Lett 51(3) (1994), 133-140.
25. D.S. Hochbaum and D.B. Shmoys, Using dual approximation algorithms for scheduling problems: Theoretical and practical results, J Assoc Comput Machinery 34(1) (1987), 144-162.
26. D.S. Hochbaum and D.B. Shmoys, A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach, SIAM J Comput 17(3) (1988), 539-551.
27. V. Kann, On the Approximability of NP-Complete Optimization Problems, Ph.D. thesis, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, Stochholm, 1992.
28. R.M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Editors), Plenum Press, New York, 1972, pp. 85-103.
29. M. Kearns and D. Ron, Testing problems with sub-learning sample complexity, J Comput System Sci 61(3) (2000), 428-456.
30. C. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J Comput System Sci 43 (1991), 425-440.
31. M. Parnas and D. Ron, Testing the diameter of graphs, Proc Random99, 1999, pp. 85-96, Random Structures and Algorithms, to appear.
32. R. Rubinfeld, Robust functional equations and their applications to program testing, SIAM J. Comput. 28(6) (1999), 1972-1997.
33. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J Comput 25(2) (1996), 252-271.
34. P.D. Seymour, Packing directed circuits fractionally, Combinatorica 15(2) (1995), 281-288.