Edge-connectivity augmentation problems
Journal of Computer and System Sciences
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory Series B
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Testing the diameter of graphs
Random Structures & Algorithms
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Incresing the Vertex-Connectivity in Directed Graphs
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Independence free graphs and vertex connectivity augmentation
Journal of Combinatorial Theory Series B
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Testing versus Estimation of Graph Properties
SIAM Journal on Computing
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Every Monotone Graph Property Is Testable
SIAM Journal on Computing
Property Testing on k-Vertex-Connectivity of Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On the Query Complexity of Testing Orientations for Being Eulerian
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
SIAM Journal on Computing
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Local Graph Partitions for Approximation and Testing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
| Hi-index | 5.23 |
Property testing problems are relaxations of decision problems. A property testing algorithm (referred to as a testing algorithm or tester) has to decide if a given object has a prespecified property or is @e-far from the property (for a given distance parameter @e, and for a prespecified distance measure). The tester is given query access to the input, and is required to run in sublinear time. In this paper, we focus on testing properties of directed graphs (digraphs). In particular, we present the following results (where n is the number of vertices in the graph, d is the maximum degree, and d"a"v"g is the average degree). *We present a testing algorithm for the property of Eulerianity in bounded-degree digraphs, which runs in timeO@?(1/@e). For unbounded-degree digraphs, we show a lower bound of @W(n/@e), and give a testing algorithm that runs in time O@?(n/@e^3^/^2). *We study the property of k-vertex-connectivity, and give testing algorithms for both bounded-degree and unbounded-degree digraphs that run in time O@?((ck@ed)^kd) and O@?((ck@ed"a"v"g)^k^+^1), respectively (where c1 is a constant). In addition, we give a simpler analysis of the testing algorithm for k-vertex-connectivity in bounded-degree undirected graphs that was shown by Yoshida and Ito [Y. Yoshida, H. Ito, Property testing on k-vertex-connectivity of graphs, in: ICALP'08: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part I, Springer-Verlag, Berlin, Heidelberg, 2008, pp. 539-550] and extend the result to unbounded-degree undirected graphs. *We consider the property of k-edge-connectivity in digraphs, and simplify the analysis of the algorithm of Yoshida and Ito [Y. Yoshida, H. Ito, Testing k-edge-connectivity of digraphs, Journal of System Science and Complexity 23 (1) (2010) 91-101] for this property. In addition, we give a simpler analysis for the correctness of the testing algorithm for k-edge-connectivity in undirected graphs that was introduced by Goldreich and Ron [O. Goldreich, D. Ron, Property testing in bounded degree graphs, Algorithmica (2002) 302-343].