Abstract
We study property testing in directed graphs in the bounded degree model, where we assume that an algorithm may only query the outgoing edges of a vertex, a model proposed by Bender and Ron [4]. As our first main result, we we present the first property testing algorithm for strong connectivity in this model, having a query complexity of \(\ensuremath{\mathcal{O}}(n^{1-\epsilon/(3+\alpha)})\) for arbitrary α > 0; it is based on a reduction to estimating the vertex indegree distribution. For subgraph-freeness we give a property testing algorithm with a query complexity of \(\ensuremath{\mathcal{O}}(n^{1-1/k})\), where k is the number of connected componentes in the queried subgraph which have no incoming edge. We furthermore take a look at the problem of testing whether a weakly connected graph contains vertices with a degree of least 3, which can be viewed as testing for freeness of all orientations of 3-stars; as our second main result, we show that this property can be tested with a query complexity of \(\ensuremath{\mathcal{O}}(\sqrt{n})\) instead of, what would be expected, Ω(n 2/3).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N.: Testing subgraphs in large graphs. Random Struct. Algorithms 21(3-4), 359–370 (2002)
Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: it’s all about regularity. SIAM Journal on Computing 39(1), 143–167 (2009)
Alon, N., Shapira, A.: Testing subgraphs in directed graphs. In: Proc. of the 35th ACM Symp. on the Theory of Computing (STOC), pp. 700–709 (2003)
Bender, M.A., Ron, D.: Testing properties of directed graphs: acyclicity and connectivity. Random Structures & Algorithms 20(2), 184–205 (2002)
Benjamini, I., Schramm, O., Shapira, A.: Every minor-closed property of sparse graphs is testable. In: Proc. of the 40th ACM Symp. on the Theory of Computing (STOC), pp. 393–402 (2008)
Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM Journal on Computing 34(6), 1370–1379 (2005)
Czumaj, A., Shapira, A., Sohler, C.: Testing hereditary properties of non-expanding bounded-degree graphs. SIAM Journal on Computing 38(6), 2499–2510 (2009)
Goldreich, O., Goldwasser, S., Ron, D.: Property Testing and its Connection to Learning and Approximation. J. of the ACM 45(4), 653–750 (1998)
Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. In: Proc. of the 29th ACM Symp. on the Theory of Computing (STOC), pp. 406–415 (1997)
Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: Proc. of the 50th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 22–31 (2009)
Newman, I., Sohler, C.: Every property of hyper nite graphs is testable. In: Proc. of the 43rd ACM Symp. on the Theory of Computing (STOC), pp. 675–684 (2011)
Rubinfeld, R., Sudan, M.: Robust Characterizations of Polynomials with Applications to Program Testing. SIAM Journal on Computing 25(2), 252–271 (1996)
Yoshida, Y., Ito, H.: Testing k-edge-connectivity of digraphs. Journal of System Science and Complexity 23(1), 91–101 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hellweg, F., Sohler, C. (2012). Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)