Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Approximations for the maximum acyclic subgraph problem
Information Processing Letters
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Tight bounds for the maximum acyclic subgraph problem
Journal of Algorithms
New sampling-based summary statistics for improving approximate query answers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A sublinear bipartiteness tester for bounded degree graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Testing problems with sub-learning sample complexity
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Synopsis data structures for massive data sets
External memory algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Testing the Diameter of Graphs
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient Testing of Large Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistic checking of proofs; a new characterization of NP
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On the robustness of functional equations
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Introduction to testing graph properties
Studies in complexity and cryptography
Testing the (s,t)-disconnectivity of graphs and digraphs
Theoretical Computer Science
Hi-index | 0.00 |
This paper initiates the study of testing properties of directed graphs. In particular, the paper considers the most basic property of directed graphs - acyclicity. Because the choice of representation affects the choice of algorithm, the two main representations of graphs are studied. For the adjacency matrix representation, most appropriate for dense graphs, a testing algorithm is developed that requires query and time complexity of Õ(1/Ɛ2), where Ɛ is a distance parameter independent of the size of the graph. The algorithm, which can probe the adjacency matrix of the graph, accepts every graph that is acyclic, and rejects, with probability at least 2/3, every graph whose adjacency matrix should be modified in at least Ɛ fraction of its entries so that it become acyclic. For the incidence list representation, most appropriate for sparse graphs, an Ω(|V|1/3) lower bound is proved on the number of queries and the time required for testing, where V is the set of vertices in the graph. These results stand in contrast to what is known about testing acyclicity in undirected graphs.