Property testing in gradbeschränkten gerichteten Graphen unter Nichtsichtbarkeit eingehender Kanten

[1]  Asaf Shapira,et al.  Testing the expansion of a graph , 2010, Inf. Comput..

[2]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.

[3]  Oded Schramm,et al.  Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..

[4]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[5]  Micha Sharir,et al.  Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D , 2008, Discret. Comput. Geom..

[6]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[7]  Krzysztof Onak,et al.  A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size , 2011, SODA.

[8]  Ilan Newman,et al.  Lower bounds for testing Euclidean Minimum Spanning Trees , 2007, Inf. Process. Lett..

[9]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[10]  Ito Hiro,et al.  Testing k-Edge-Connectivity of Digraphs , 2007 .

[11]  Seshadhri Comandur,et al.  An Expansion Tester for Bounded Degree Graphs , 2008, SIAM J. Comput..

[12]  Artur Czumaj,et al.  Property Testing with Geometric Queries , 2001, ESA.

[13]  Joachim Gudmundsson,et al.  Finding the best shortcut in a geometric network , 2005, EuroCG.

[14]  Kenneth L. Clarkson,et al.  Approximation algorithms for shortest path motion planning , 1987, STOC.

[15]  Eric Blais.  Testing juntas nearly optimally , 2009, STOC '09.

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[18]  Christian Sohler,et al.  Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness , 2012, ESA.

[19]  Sariel Har-Peled,et al.  On coresets for k-means and k-median clustering , 2004, STOC '04.

[20]  Noga Alon,et al.  Testing subgraphs in directed graphs , 2004, J. Comput. Syst. Sci..

[21]  N. Alon,et al.  A separator theorem for nonplanar graphs , 1990 .

[22]  Giri Narasimhan,et al.  Approximating the Stretch Factor of Euclidean Graphs , 2000, SIAM J. Comput..

[23]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[24]  D. Ron,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002 .

[25]  Artur Czumaj,et al.  Property Testing in Computational Geometry , 2000, ESA.

[26]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[27]  Artur Czumaj,et al.  Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time , 2009, SIAM J. Comput..

[28]  Artur Czumaj,et al.  Testing Euclidean minimum spanning trees in the plane , 2008, TALG.

[29]  Ronitt Rubinfeld,et al.  Testing that distributions are close , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[31]  Dana Ron,et al.  Testing Properties of Sparse Images , 2010, FOCS.

[32]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[33]  Dana Ron,et al.  Algorithmic and Analysis Techniques in Property Testing , 2010, Found. Trends Theor. Comput. Sci..

[34]  Seshadhri Comandur,et al.  Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..

[35]  Oded Goldreich,et al.  Property Testing - Current Research and Surveys , 2010, Property Testing.

[36]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[37]  Noga Alon,et al.  Testing of clustering , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[38]  Noga Alon.  Testing subgraphs in large graphs , 2002, Random Struct. Algorithms.

[39]  Ravi Kumar,et al.  Sampling algorithms: lower bounds and applications , 2001, STOC '01.

[40]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[41]  Christian Sohler,et al.  Testing Euclidean Spanners , 2010, ESA.

[42]  Santosh S. Vempala,et al.  Testing Geometric Convexity , 2004, FSTTCS.

[43]  Dana Ron,et al.  Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem , 2009, SIAM J. Comput..

[44]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[45]  Madhu Sudan,et al.  Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..

[46]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[47]  Sofya Raskhodnikova,et al.  A Note on Adaptivity in Testing Properties of Bounded Degree Graphs , 2006, Electron. Colloquium Comput. Complex..

[48]  Artur Czumaj,et al.  Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs , 2009, SIAM J. Comput..

[49]  Eldar Fischer,et al.  Testing versus Estimation of Graph Properties , 2007, SIAM J. Comput..

[50]  Ronitt Rubinfeld,et al.  The complexity of approximating entropy , 2002, STOC '02.

[51]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[52]  Ronitt Rubinfeld,et al.  Testing random variables for independence and identity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[53]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[54]  Dana Ron,et al.  A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1999, Comb..

[55]  Bernard Chazelle,et al.  Sublinear Geometric Algorithms , 2005, SIAM J. Comput..

[56]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

[57]  Dana Ron,et al.  Testing Eulerianity and connectivity in directed sparse graphs , 2011, Theor. Comput. Sci..

[58]  Ronitt Rubinfeld,et al.  Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time , 2005, SIAM J. Comput..

[59]  S. Rao Kosaraju,et al.  Faster algorithms for some geometric graph problems in higher dimensions , 1993, SODA '93.

[60]  Dana Ron,et al.  Testing Properties of Sparse Images , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[61]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[62]  Dana Ron,et al.  Testing Monotonicity , 2000, Comb..

[63]  Yuichi Yoshida,et al.  An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.

[64]  Daniel Keren,et al.  Applying Property Testing to an Image Partitioning Problem , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[65]  Krzysztof Onak,et al.  Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[66]  M. Mitzenmacher,et al.  Probability and Computing: Chernoff Bounds , 2005 .

[67]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[68]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .